LeetCode | Simplify Path

题目

Given an absolute path for a file (Unix-style), simplify it.

For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"

click to show corner cases.

java自带的split函数，以及Stack迭代器的遍历顺序都完全符合这题的要求。

代码

import java.util.Stack;

public class SimplifyPath {
	public String simplifyPath(String path) {
		Stack<String> stack = new Stack<String>();
		String[] array = path.split("/");
		for (int i = 0; i < array.length; ++i) {
			if (array[i].length() == 0 || array[i].equals(".")) {
				continue;
			} else if (array[i].equals("..")) {
				if (!stack.isEmpty()) {
					stack.pop();
				}
			} else {
				stack.push(array[i]);
			}
		}
		StringBuilder sb = new StringBuilder("/");
		for (String e : stack) {
			sb.append(e).append("/");
		}
		return sb.length() == 1 ? sb.toString() : sb.substring(0,
				sb.length() - 1).toString();
	}
}

LeetCode | Simplify Path,布布扣,bubuko.com

LeetCode | Simplify Path

原文：http://blog.csdn.net/perfect8886/article/details/21740465