Chapter 03 codes comments updated.

liuyubobobo · liuyubobobo · commit 4404b9b41068 · 2017-11-15T11:53:08.000-08:00
diff --git a/03-Using-Array/Course Code (C++)/03-Move-Zeroes/main.cpp b/03-Using-Array/Course Code (C++)/03-Move-Zeroes/main.cpp
@@ -3,6 +3,8 @@
 
 using namespace std;
 
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
 // 时间复杂度: O(n)
 // 空间复杂度: O(n)
 class Solution {
diff --git a/03-Using-Array/Course Code (C++)/04-Move-Zeroes-II/main.cpp b/03-Using-Array/Course Code (C++)/04-Move-Zeroes-II/main.cpp
@@ -3,6 +3,8 @@
 
 using namespace std;
 
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
 // 时间复杂度: O(n)
 // 空间复杂度: O(n)
 class Solution {
diff --git a/03-Using-Array/Course Code (C++)/04-Move-Zeroes-II/main2.cpp b/03-Using-Array/Course Code (C++)/04-Move-Zeroes-II/main2.cpp
@@ -3,6 +3,9 @@
 
 using namespace std;
 
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
+//
 // 原地(in place)解决该问题
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (C++)/04-Move-Zeroes-II/main3.cpp b/03-Using-Array/Course Code (C++)/04-Move-Zeroes-II/main3.cpp
@@ -3,6 +3,9 @@
 
 using namespace std;
 
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
+//
 // 原地(in place)解决该问题
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (C++)/04-Move-Zeroes-II/main4.cpp b/03-Using-Array/Course Code (C++)/04-Move-Zeroes-II/main4.cpp
@@ -3,6 +3,9 @@
 
 using namespace std;
 
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
+//
 // 原地(in place)解决该问题
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (C++)/05-Sort-Colors/main.cpp b/03-Using-Array/Course Code (C++)/05-Sort-Colors/main.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 75. Sort Colors
+// https://leetcode.com/problems/sort-colors/description/
+//
 // 计数排序的思路
 // 对整个数组遍历了两遍
 // 时间复杂度: O(n)
diff --git a/03-Using-Array/Course Code (C++)/05-Sort-Colors/main2.cpp b/03-Using-Array/Course Code (C++)/05-Sort-Colors/main2.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 75. Sort Colors
+// https://leetcode.com/problems/sort-colors/description/
+//
 // 三路快速排序的思想
 // 对整个数组只遍历了一遍
 // 时间复杂度: O(n)
diff --git a/03-Using-Array/Course Code (C++)/06-Two-Sum-II/main.cpp b/03-Using-Array/Course Code (C++)/06-Two-Sum-II/main.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 167. Two Sum II - Input array is sorted
+// https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/
+//
 // 暴力枚举法
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (C++)/06-Two-Sum-II/main2.cpp b/03-Using-Array/Course Code (C++)/06-Two-Sum-II/main2.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 167. Two Sum II - Input array is sorted
+// https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/
+//
 // 二分搜索法
 // 时间复杂度: O(nlogn)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (C++)/06-Two-Sum-II/main3.cpp b/03-Using-Array/Course Code (C++)/06-Two-Sum-II/main3.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 167. Two Sum II - Input array is sorted
+// https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/
+//
 // 对撞指针
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main.cpp b/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 暴力解法
 // 该方法在 Leetcode 中会超时！
 // 时间复杂度: O(n^3)
diff --git a/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main2.cpp b/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main2.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 优化暴力解
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(n)
diff --git a/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main3.cpp b/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main3.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 滑动窗口的思路
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main4.cpp b/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main4.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 另外一个滑动窗口的实现, 仅供参考
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main5.cpp b/03-Using-Array/Course Code (C++)/07-Minimum-Size-Subarray-Sum/main5.cpp
@@ -5,6 +5,9 @@
 
 using namespace std;
 
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 二分搜索
 // 扩展main2的方法。对于每一个l, 可以使用二分搜索法搜索r
 //
diff --git a/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main.cpp b/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 滑动窗口
 // 时间复杂度: O(len(s))
 // 空间复杂度: O(len(charset))
diff --git a/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main2.cpp b/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main2.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 滑动窗口
 // 时间复杂度: O(len(s))
 // 空间复杂度: O(len(charset))
diff --git a/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main3.cpp b/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main3.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 滑动窗口的另一个实现, 仅做参考
 // 时间复杂度: O(len(s))
 // 空间复杂度: O(len(charset))
diff --git a/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main4.cpp b/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main4.cpp
@@ -4,6 +4,9 @@
 
 using namespace std;
 
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 课程问答区 @yatkun 提出的方法,
 // l每次可以向前跳跃, 而不仅仅是+1
 // 但代价是, 为了获得这个跳跃的位置, 每次需要遍历整个窗口的字符串
diff --git a/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main5.cpp b/03-Using-Array/Course Code (C++)/08-Longest-Substring-Without-Repeating-Characters/main5.cpp
@@ -4,11 +4,14 @@
 
 using namespace std;
 
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 滑动窗口
 // 其中使用last[c]保存字符c上一次出现的位置, 用于在右边界发现重复字符时, 快速移动左边界
 // 使用这种方法, 时间复杂度依然为O(n), 但是只需要动r指针, 实际上对整个s只遍历了一次
 // 相较而言, 之前的方法, 需要移动l和r两个指针, 相对于对s遍历了两次
-
+//
 // 时间复杂度: O(len(s))
 // 空间复杂度: O(len(charset))
 class Solution {
diff --git a/03-Using-Array/Course Code (Java)/03-Move-Zeroes/src/Solution.java b/03-Using-Array/Course Code (Java)/03-Move-Zeroes/src/Solution.java
@@ -1,5 +1,7 @@
 import java.util.*;
 
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
 // 时间复杂度: O(n)
 // 空间复杂度: O(n)
 class Solution {
diff --git a/03-Using-Array/Course Code (Java)/04-Move-Zeroes-II/src/Solution1.java b/03-Using-Array/Course Code (Java)/04-Move-Zeroes-II/src/Solution1.java
@@ -1,5 +1,7 @@
 import java.util.*;
 
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
 // 时间复杂度: O(n)
 // 空间复杂度: O(n)
 class Solution1 {
diff --git a/03-Using-Array/Course Code (Java)/04-Move-Zeroes-II/src/Solution2.java b/03-Using-Array/Course Code (Java)/04-Move-Zeroes-II/src/Solution2.java
@@ -1,3 +1,6 @@
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
+//
 // 原地(in place)解决该问题
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (Java)/04-Move-Zeroes-II/src/Solution3.java b/03-Using-Array/Course Code (Java)/04-Move-Zeroes-II/src/Solution3.java
@@ -1,5 +1,6 @@
-import java.util.*;
-
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
+//
 // 原地(in place)解决该问题
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (Java)/04-Move-Zeroes-II/src/Solution4.java b/03-Using-Array/Course Code (Java)/04-Move-Zeroes-II/src/Solution4.java
@@ -1,5 +1,6 @@
-import java.util.*;
-
+// 283. Move Zeroes
+// https://leetcode.com/problems/move-zeroes/description/
+//
 // 原地(in place)解决该问题
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (Java)/05-Sort-Colors/src/Solution1.java b/03-Using-Array/Course Code (Java)/05-Sort-Colors/src/Solution1.java
@@ -1,3 +1,6 @@
+// 75. Sort Colors
+// https://leetcode.com/problems/sort-colors/description/
+//
 // 计数排序的思路
 // 对整个数组遍历了两遍
 // 时间复杂度: O(n)
diff --git a/03-Using-Array/Course Code (Java)/05-Sort-Colors/src/Solution2.java b/03-Using-Array/Course Code (Java)/05-Sort-Colors/src/Solution2.java
@@ -1,3 +1,6 @@
+// 75. Sort Colors
+// https://leetcode.com/problems/sort-colors/description/
+//
 // 三路快速排序的思想
 // 对整个数组只遍历了一遍
 // 时间复杂度: O(n)
diff --git a/03-Using-Array/Course Code (Java)/06-Two-Sum-II/src/Solution1.java b/03-Using-Array/Course Code (Java)/06-Two-Sum-II/src/Solution1.java
@@ -1,3 +1,6 @@
+// 167. Two Sum II - Input array is sorted
+// https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/
+//
 // 暴力枚举法
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (Java)/06-Two-Sum-II/src/Solution2.java b/03-Using-Array/Course Code (Java)/06-Two-Sum-II/src/Solution2.java
@@ -1,3 +1,6 @@
+// 167. Two Sum II - Input array is sorted
+// https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/
+//
 // 二分搜索法
 // 时间复杂度: O(nlogn)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (Java)/06-Two-Sum-II/src/Solution3.java b/03-Using-Array/Course Code (Java)/06-Two-Sum-II/src/Solution3.java
@@ -1,3 +1,6 @@
+// 167. Two Sum II - Input array is sorted
+// https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/
+//
 // 对撞指针
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution1.java b/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution1.java
@@ -1,3 +1,6 @@
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 暴力解法
 // 该方法在 Leetcode 中会超时！
 // 时间复杂度: O(n^3)
diff --git a/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution2.java b/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution2.java
@@ -1,3 +1,6 @@
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 优化暴力解
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(n)
diff --git a/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution3.java b/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution3.java
@@ -1,3 +1,6 @@
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 滑动窗口的思路
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution4.java b/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution4.java
@@ -1,3 +1,6 @@
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 另外一个滑动窗口的实现, 仅供参考
 // 时间复杂度: O(n)
 // 空间复杂度: O(1)
diff --git a/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution5.java b/03-Using-Array/Course Code (Java)/07-Minimum-Size-Subarray-Sum/src/Solution5.java
@@ -1,3 +1,6 @@
+// 209. Minimum Size Subarray Sum
+// https://leetcode.com/problems/minimum-size-subarray-sum/description/
+//
 // 二分搜索
 // 扩展 Solution2 的方法。对于每一个l, 可以使用二分搜索法搜索r
 //
diff --git a/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution1.java b/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution1.java
@@ -1,3 +1,6 @@
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 滑动窗口
 // 时间复杂度: O(len(s))
 // 空间复杂度: O(len(charset))
diff --git a/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution2.java b/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution2.java
@@ -1,3 +1,6 @@
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 滑动窗口
 // 时间复杂度: O(len(s))
 // 空间复杂度: O(len(charset))
diff --git a/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution3.java b/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution3.java
@@ -1,3 +1,6 @@
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 滑动窗口的另一个实现, 仅做参考
 // 时间复杂度: O(len(s))
 // 空间复杂度: O(len(charset))
diff --git a/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution4.java b/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution4.java
@@ -1,3 +1,6 @@
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 课程问答区 @yatkun 提出的方法,
 // l每次可以向前跳跃, 而不仅仅是+1
 // 但代价是, 为了获得这个跳跃的位置, 每次需要遍历整个窗口的字符串
diff --git a/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution5.java b/03-Using-Array/Course Code (Java)/08-Longest-Substring-Without-Repeating-Characters/src/Solution5.java
@@ -1,3 +1,6 @@
+// 3. Longest Substring Without Repeating Characters
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+//
 // 滑动窗口
 // 其中使用last[c]保存字符c上一次出现的位置, 用于在右边界发现重复字符时, 快速移动左边界
 // 使用这种方法, 时间复杂度依然为O(n), 但是只需要动r指针, 实际上对整个s只遍历了一次
