Chapter 04 codes comments updated.

liuyubobobo · liuyubobobo · commit 0ab915da69b5 · 2017-11-15T11:40:46.000-08:00
diff --git a/04-Using-Hash-Table/Course Code (C++)/01-Intersection-of-Two-Arrays/main.cpp b/04-Using-Hash-Table/Course Code (C++)/01-Intersection-of-Two-Arrays/main.cpp
@@ -1,9 +1,13 @@
 #include <iostream>
 #include <vector>
 #include <set>
+
 using namespace std;
 
-/// 349. Intersection of Two Arrays
+// 349. Intersection of Two Arrays
+// https://leetcode.com/problems/intersection-of-two-arrays/description/
+// 时间复杂度: O(nlogn)
+// 空间复杂度: O(n)
 class Solution {
 public:
     vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
diff --git a/04-Using-Hash-Table/Course Code (C++)/01-Intersection-of-Two-Arrays/main2.cpp b/04-Using-Hash-Table/Course Code (C++)/01-Intersection-of-Two-Arrays/main2.cpp
@@ -3,7 +3,10 @@
 #include <set>
 using namespace std;
 
-/// 349. Intersection of Two Arrays
+// 349. Intersection of Two Arrays
+// https://leetcode.com/problems/intersection-of-two-arrays/description/
+// 时间复杂度: O(nlogn)
+// 空间复杂度: O(n)
 class Solution {
 public:
     vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
diff --git a/04-Using-Hash-Table/Course Code (C++)/02-Intersection-of-Two-Arrays-II/main.cpp b/04-Using-Hash-Table/Course Code (C++)/02-Intersection-of-Two-Arrays-II/main.cpp
@@ -1,9 +1,13 @@
 #include <iostream>
 #include <vector>
 #include <map>
+
 using namespace std;
 
-/// 350. Intersection of Two Arrays II
+// 350. Intersection of Two Arrays II
+// https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
+// 时间复杂度: O(nlogn)
+// 空间复杂度: O(n)
 class Solution {
 public:
     vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
diff --git a/04-Using-Hash-Table/Course Code (C++)/02-Intersection-of-Two-Arrays-II/main2.cpp b/04-Using-Hash-Table/Course Code (C++)/02-Intersection-of-Two-Arrays-II/main2.cpp
@@ -4,7 +4,10 @@
 
 using namespace std;
 
-/// 350. Intersection of Two Arrays II
+// 350. Intersection of Two Arrays II
+// https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
+// 时间复杂度: O(nlogn)
+// 空间复杂度: O(n)
 class Solution {
 public:
     vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
diff --git a/04-Using-Hash-Table/Course Code (C++)/02-Intersection-of-Two-Arrays-II/main3.cpp b/04-Using-Hash-Table/Course Code (C++)/02-Intersection-of-Two-Arrays-II/main3.cpp
@@ -4,8 +4,10 @@
 
 using namespace std;
 
-/// 350. Intersection of Two Arrays II
-/// Using multiset
+// 350. Intersection of Two Arrays II
+// https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
+// 时间复杂度: O(nlogn)
+// 空间复杂度: O(n)
 class Solution {
 public:
     vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
diff --git a/04-Using-Hash-Table/Course Code (C++)/03-More-About-Set-And-Map/main.cpp b/04-Using-Hash-Table/Course Code (C++)/03-More-About-Set-And-Map/main.cpp
@@ -3,7 +3,10 @@
 #include <unordered_set>
 using namespace std;
 
-/// 349. Intersection of Two Arrays
+// 349. Intersection of Two Arrays
+// https://leetcode.com/problems/intersection-of-two-arrays/description/
+// 时间复杂度: O(len(nums1)+len(nums2))
+// 空间复杂度: O(len(nums1))
 class Solution {
 public:
     vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
diff --git a/04-Using-Hash-Table/Course Code (C++)/03-More-About-Set-And-Map/main2.cpp b/04-Using-Hash-Table/Course Code (C++)/03-More-About-Set-And-Map/main2.cpp
@@ -3,7 +3,10 @@
 #include <unordered_map>
 using namespace std;
 
-/// 350. Intersection of Two Arrays II
+// 350. Intersection of Two Arrays II
+// https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
+// 时间复杂度: O(len(nums1)+len(nums2))
+// 空间复杂度: O(len(nums1))
 class Solution {
 public:
     vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
diff --git a/04-Using-Hash-Table/Course Code (C++)/04-Two-Sum/main.cpp b/04-Using-Hash-Table/Course Code (C++)/04-Two-Sum/main.cpp
@@ -5,6 +5,8 @@
 
 using namespace std;
 
+// 1. Two Sum
+// https://leetcode.com/problems/two-sum/description/
 // 时间复杂度：O(n)
 // 空间复杂度：O(n)
 class Solution {
diff --git a/04-Using-Hash-Table/Course Code (C++)/05-4Sum-II/main.cpp b/04-Using-Hash-Table/Course Code (C++)/05-4Sum-II/main.cpp
@@ -5,6 +5,8 @@
 
 using namespace std;
 
+// 454. 4Sum II
+// https://leetcode.com/problems/4sum-ii/description/
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(n^2)
 class Solution {
diff --git a/04-Using-Hash-Table/Course Code (C++)/05-4Sum-II/main2.cpp b/04-Using-Hash-Table/Course Code (C++)/05-4Sum-II/main2.cpp
@@ -6,6 +6,8 @@
 
 using namespace std;
 
+// 454. 4Sum II
+// https://leetcode.com/problems/4sum-ii/description/
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(n^2)
 class Solution {
diff --git a/04-Using-Hash-Table/Course Code (C++)/06-Number-of-Boomerangs/main.cpp b/04-Using-Hash-Table/Course Code (C++)/06-Number-of-Boomerangs/main.cpp
@@ -6,6 +6,8 @@
 
 using namespace std;
 
+// 447. Number of Boomerangs
+// https://leetcode.com/problems/number-of-boomerangs/description/
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(n)
 class Solution {
diff --git a/04-Using-Hash-Table/Course Code (C++)/07-Contains-Duplicate-II/main.cpp b/04-Using-Hash-Table/Course Code (C++)/07-Contains-Duplicate-II/main.cpp
@@ -4,6 +4,8 @@
 
 using namespace std;
 
+// 219. Contains Duplicate II
+// https://leetcode.com/problems/contains-duplicate-ii/description/
 // 时间复杂度: O(n)
 // 空间复杂度: O(k)
 class Solution {
diff --git a/04-Using-Hash-Table/Course Code (Java)/01-Intersection-of-Two-Arrays/src/Solution.java b/04-Using-Hash-Table/Course Code (Java)/01-Intersection-of-Two-Arrays/src/Solution.java
@@ -1,6 +1,9 @@
 import java.util.TreeSet;
 
-/// 349. Intersection of Two Arrays
+// 349. Intersection of Two Arrays
+// https://leetcode.com/problems/intersection-of-two-arrays/description/
+// 时间复杂度: O(nlogn)
+// 空间复杂度: O(n)
 public class Solution {
 
     public int[] intersection(int[] nums1, int[] nums2) {
diff --git a/04-Using-Hash-Table/Course Code (Java)/02-Intersection-of-Two-Arrays-II/src/Solution.java b/04-Using-Hash-Table/Course Code (Java)/02-Intersection-of-Two-Arrays-II/src/Solution.java
@@ -1,7 +1,10 @@
 import java.util.TreeMap;
 import java.util.ArrayList;
 
-/// 350. Intersection of Two Arrays II
+// 350. Intersection of Two Arrays II
+// https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
+// 时间复杂度: O(nlogn)
+// 空间复杂度: O(n)
 public class Solution {
 
     public int[] intersect(int[] nums1, int[] nums2) {
diff --git a/04-Using-Hash-Table/Course Code (Java)/03-More-About-Set-And-Map/src/Solution349.java b/04-Using-Hash-Table/Course Code (Java)/03-More-About-Set-And-Map/src/Solution349.java
@@ -1,6 +1,9 @@
 import java.util.HashSet;
 
-/// 349. Intersection of Two Arrays
+// 349. Intersection of Two Arrays
+// https://leetcode.com/problems/intersection-of-two-arrays/description/
+// 时间复杂度: O(len(nums1)+len(nums2))
+// 空间复杂度: O(len(nums1))
 public class Solution349 {
 
     public int[] intersection(int[] nums1, int[] nums2) {
diff --git a/04-Using-Hash-Table/Course Code (Java)/03-More-About-Set-And-Map/src/Solution350.java b/04-Using-Hash-Table/Course Code (Java)/03-More-About-Set-And-Map/src/Solution350.java
@@ -1,7 +1,10 @@
 import java.util.HashMap;
 import java.util.ArrayList;
 
-/// 350. Intersection of Two Arrays II
+// 350. Intersection of Two Arrays II
+// https://leetcode.com/problems/intersection-of-two-arrays-ii/description/
+// 时间复杂度: O(len(nums1)+len(nums2))
+// 空间复杂度: O(len(nums1))
 public class Solution350 {
 
     public int[] intersect(int[] nums1, int[] nums2) {
diff --git a/04-Using-Hash-Table/Course Code (Java)/04-Two-Sum/src/Solution.java b/04-Using-Hash-Table/Course Code (Java)/04-Two-Sum/src/Solution.java
@@ -1,5 +1,7 @@
 import java.util.HashMap;
 
+// 1. Two Sum
+// https://leetcode.com/problems/two-sum/description/
 // 时间复杂度：O(n)
 // 空间复杂度：O(n)
 public class Solution {
diff --git a/04-Using-Hash-Table/Course Code (Java)/05-4Sum-II/src/Solution1.java b/04-Using-Hash-Table/Course Code (Java)/05-4Sum-II/src/Solution1.java
@@ -1,5 +1,7 @@
 import java.util.HashMap;
 
+// 454. 4Sum II
+// https://leetcode.com/problems/4sum-ii/description/
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(n^2)
 public class Solution1 {
diff --git a/04-Using-Hash-Table/Course Code (Java)/05-4Sum-II/src/Solution2.java b/04-Using-Hash-Table/Course Code (Java)/05-4Sum-II/src/Solution2.java
@@ -1,5 +1,7 @@
 import java.util.HashMap;
 
+// 454. 4Sum II
+// https://leetcode.com/problems/4sum-ii/description/
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(n^2)
 public class Solution2 {
diff --git a/04-Using-Hash-Table/Course Code (Java)/06-Number-of-Boomerangs/src/Solution.java b/04-Using-Hash-Table/Course Code (Java)/06-Number-of-Boomerangs/src/Solution.java
@@ -1,5 +1,7 @@
 import java.util.HashMap;
 
+// 447. Number of Boomerangs
+// https://leetcode.com/problems/number-of-boomerangs/description/
 // 时间复杂度: O(n^2)
 // 空间复杂度: O(n)
 public class Solution {
diff --git a/04-Using-Hash-Table/Course Code (Java)/07-Contains-Duplicate-II/src/Solution.java b/04-Using-Hash-Table/Course Code (Java)/07-Contains-Duplicate-II/src/Solution.java
@@ -1,5 +1,7 @@
 import java.util.HashSet;
 
+// 219. Contains Duplicate II
+// https://leetcode.com/problems/contains-duplicate-ii/description/
 // 时间复杂度: O(n)
 // 空间复杂度: O(k)
 public class Solution {
