modify code on class

Author: algorithmzuo

src/topinterviewquestions/Problem_0131_PalindromePartitioning.java

@@ -7,6 +7,7 @@
 public class Problem_0131_PalindromePartitioning {
 
 	public static List<List<String>> partition(String s) {
+		// dp[L][R] -> 是不是回文
 		boolean[][] dp = getdp(s.toCharArray());
 		LinkedList<String> path = new LinkedList<>();
 		List<List<String>> ans = new ArrayList<>();
@@ -34,11 +35,20 @@ public static boolean[][] getdp(char[] str) {
 		return dp;
 	}
 
-	public static void process(String s, int index, LinkedList<String> path, boolean[][] dp, List<List<String>> ans) {
+	// s 字符串
+	// s[0...index-1] 已经做过的决定，放入了path中
+	// 在index开始做属于这个位置的决定，
+	// index == s.len  path之前做的决定（一种分割方法），放进总答案ans里
+	public static void process(String s, int index, LinkedList<String> path, 
+			boolean[][] dp, List<List<String>> ans) {
 		if (index == s.length()) {
 			ans.add(copy(path));
 		} else {
 			for (int end = index; end < s.length(); end++) {
+				// index..index   
+				// index..index+1
+				// index..index+2
+				// index..end
 				if (dp[index][end]) {
 					path.addLast(s.substring(index, end + 1));
 					process(s, end + 1, path, dp, ans);

src/topinterviewquestions/Problem_0134_GasStation.java

@@ -140,5 +140,83 @@ public static int lastIndex(int index, int size) {
 	public static int nextIndex(int index, int size) {
 		return index == size - 1 ? 0 : (index + 1);
 	}
+	
+	
+//  以下的code是返回所有点是不是良好出发点的结果数组
+//	public static boolean[] stations(int[] dis, int[] oil) {
+//		if (dis == null || oil == null || dis.length < 2
+//				|| dis.length != oil.length) {
+//			return null;
+//		}
+//		int init = changeDisArrayGetInit(dis, oil);
+//		return init == -1 ? new boolean[dis.length] : enlargeArea(dis, init);
+//	}
+//
+//	public static int changeDisArrayGetInit(int[] dis, int[] oil) {
+//		int init = -1;
+//		for (int i = 0; i < dis.length; i++) {
+//			dis[i] = oil[i] - dis[i];
+//			if (dis[i] >= 0) {
+//				init = i;
+//			}
+//		}
+//		return init;
+//	}
+//
+//	public static boolean[] enlargeArea(int[] dis, int init) {
+//		boolean[] res = new boolean[dis.length];
+//		int start = init;
+//		int end = nextIndex(init, dis.length);
+//		int need = 0;
+//		int rest = 0;
+//		do {
+//			// 当前来到的start已经在连通区域中，可以确定后续的开始点一定无法转完一圈
+//			if (start != init && start == lastIndex(end, dis.length)) {
+//				break;
+//			}
+//			// 当前来到的start不在连通区域中，就扩充连通区域
+//			if (dis[start] < need) { // 当前start无法接到连通区的头部
+//				need -= dis[start];
+//			} else { // 当前start可以接到连通区的头部，开始扩充连通区域的尾巴
+//				rest += dis[start] - need;
+//				need = 0;
+//				while (rest >= 0 && end != start) {
+//					rest += dis[end];
+//					end = nextIndex(end, dis.length);
+//				}
+//				// 如果连通区域已经覆盖整个环，当前的start是良好出发点，进入2阶段
+//				if (rest >= 0) {
+//					res[start] = true;
+//					connectGood(dis, lastIndex(start, dis.length), init, res);
+//					break;
+//				}
+//			}
+//			start = lastIndex(start, dis.length);
+//		} while (start != init);
+//		return res;
+//	}
+//
+//	// 已知start的next方向上有一个良好出发点
+//	// start如果可以达到这个良好出发点，那么从start出发一定可以转一圈
+//	public static void connectGood(int[] dis, int start, int init, boolean[] res) {
+//		int need = 0;
+//		while (start != init) {
+//			if (dis[start] < need) {
+//				need -= dis[start];
+//			} else {
+//				res[start] = true;
+//				need = 0;
+//			}
+//			start = lastIndex(start, dis.length);
+//		}
+//	}
+//
+//	public static int lastIndex(int index, int size) {
+//		return index == 0 ? (size - 1) : index - 1;
+//	}
+//
+//	public static int nextIndex(int index, int size) {
+//		return index == size - 1 ? 0 : (index + 1);
+//	}
 
 }