change the oj.leetcode.com to leetcode.com

Author: illuz

Diff for: solutions/001.Two_Sum/readme.md

@@ -1,7 +1,7 @@
 ## 001.Two_Sum (Medium)  
 
 ### **链接**：  
-题目：https://oj.leetcode.com/problems/two-sum/  
+题目：https://leetcode.com/problems/two-sum/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：  
@@ -21,7 +21,7 @@
 ## 001.Two_Sum (Medium)  
 
 ### **Link**:  
-Problem: https://oj.leetcode.com/problems/two-sum/  
+Problem: https://leetcode.com/problems/two-sum/  
 Newest solutions in my Github: https://github.com/illuz/leetcode  
 
 ### **Analysis**：  

Diff for: solutions/002.Add_Two_Numbers/readme.md

@@ -2,7 +2,7 @@
 
 
 ### **链接**：  
-题目：https://oj.leetcode.com/problems/add-two-numbers/  
+题目：https://leetcode.com/problems/add-two-numbers/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：  
@@ -19,7 +19,7 @@
 
 
 **Link**:  
-Problem: https://oj.leetcode.com/problems/add-two-numbers/  
+Problem: https://leetcode.com/problems/add-two-numbers/  
 Newest solutions in my Github: https://github.com/illuz/leetcode  
 
 **Analysis**：  

Diff for: solutions/003.Longest_Substring_Without_Repeating_Characters/readme.md

@@ -2,7 +2,7 @@
 ## 003.Longest_Substring_Without_Repeating_Characters  
 
 ### **链接**：  
-题目：https://oj.leetcode.com/problems/Longest-Substring-Without-Repeating-Characters/  
+题目：https://leetcode.com/problems/Longest-Substring-Without-Repeating-Characters/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：  
@@ -22,7 +22,7 @@
 
 
 **Link**:  
-Problem: https://oj.leetcode.com/problems/Longest-Substring-Without-Repeating-Characters/  
+Problem: https://leetcode.com/problems/Longest-Substring-Without-Repeating-Characters/  
 Newest solutions in my Github: https://github.com/illuz/leetcode  
 
 **Analysis**：  

Diff for: solutions/004.Median_of_Two_Sorted_Arrays/readme.md

@@ -2,7 +2,7 @@
 ## 004.Median_of_Two_Sorted_Arrays
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/Median-of-Two-Sorted-Arrays/
+题目：https://leetcode.com/problems/Median-of-Two-Sorted-Arrays/
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：
@@ -21,7 +21,7 @@
 
 
 **Link**:
-Problem: https://oj.leetcode.com/problems/Median-of-Two-Sorted-Arrays/
+Problem: https://leetcode.com/problems/Median-of-Two-Sorted-Arrays/
 Newest solutions in my Github: https://github.com/illuz/leetcode
 
 **Analysis**：

Diff for: solutions/005.Longest_Palindromic_Substring/readme.md

@@ -1,7 +1,7 @@
 ## 005.Longest_Palindromic_Substring (Medium)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/Longest-Palindromic-Substring/  
+题目：https://leetcode.com/problems/Longest-Palindromic-Substring/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：

Diff for: solutions/006.ZigZag_Conversion/readme.md

@@ -1,7 +1,7 @@
 ## 006.ZigZag_Conversion (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/zigzag-conversion/  
+题目：https://leetcode.com/problems/zigzag-conversion/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：

Diff for: solutions/007.Reverse_Integer/readme.md

@@ -1,7 +1,7 @@
 ## 007.Reverse_Integer (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/Reverse-Integer/  
+题目：https://leetcode.com/problems/Reverse-Integer/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/008.String_to_Integer/readme.md

@@ -1,7 +1,7 @@
 ## 008.String_to_Integer (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/string-to-integer-atoi/  
+题目：https://leetcode.com/problems/string-to-integer-atoi/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/009.Palindrome_Number/readme.md

@@ -1,7 +1,7 @@
 ## 009.Palindrome_Number
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/palindrome-number/  
+题目：https://leetcode.com/problems/palindrome-number/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/010.Regular_Expression_Matching/readme.md

@@ -1,7 +1,7 @@
 ## 010.Regular_Expression_Matching
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/regular-expression-matching/  
+题目：https://leetcode.com/problems/regular-expression-matching/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：
@@ -13,6 +13,6 @@
 1. 偷懒的方法是直接用语言自带的正则实现。(Python 又是一句话 =w=)
 2. 用 DFS 的方法
 3. 可以用 DP 的方法
-    - 用数组 DP :`dp[i][j]` 表示 s[0..i] 和 p[0..j] 是否 match，当 `p[j] != '*'`，`b[i + 1][j + 1] = b[i][j] && s[i] == p[j]` ，当 `p[j] == '*'` 要再分类讨论，具体可以参考 [DP C++](https://oj.leetcode.com/discuss/18970/concise-recursive-and-dp-solutions-with-full-explanation-in)，还可以压缩下把 dp 降成一维：参考[这里](https://oj.leetcode.com/discuss/19902/share-a-scarce-dp-solution-in-java-time-o-mn-spaceo-n)
+    - 用数组 DP :`dp[i][j]` 表示 s[0..i] 和 p[0..j] 是否 match，当 `p[j] != '*'`，`b[i + 1][j + 1] = b[i][j] && s[i] == p[j]` ，当 `p[j] == '*'` 要再分类讨论，具体可以参考 [DP C++](https://leetcode.com/discuss/18970/concise-recursive-and-dp-solutions-with-full-explanation-in)，还可以压缩下把 dp 降成一维：参考[这里](https://leetcode.com/discuss/19902/share-a-scarce-dp-solution-in-java-time-o-mn-spaceo-n)
     - 用记忆化，就是把算过的结果保存下来，下次就不用再算了
 

Diff for: solutions/011.Container_With_Most_Water/readme.md

@@ -1,7 +1,7 @@
 ## 011.Container_With_Most_Water
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/container-with-most-water/  
+题目：https://leetcode.com/problems/container-with-most-water/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/012.Integer_to_Roman/readme.md

@@ -1,7 +1,7 @@
 ## 012.Integer_to_Roman (Medium)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/integer-to-roman/
+题目：https://leetcode.com/problems/integer-to-roman/
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/013.Roman_to_Integer/readme.md

@@ -1,7 +1,7 @@
 ## 013.Roman_to_Integer (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/roman-to-integer/  
+题目：https://leetcode.com/problems/roman-to-integer/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/014.Longest_Common_Prefix/readme.md

@@ -1,7 +1,7 @@
 ## 014.Longest_Common_Prefix (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/longest-common-prefix/  
+题目：https://leetcode.com/problems/longest-common-prefix/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/015.3Sum/readme.md

@@ -1,7 +1,7 @@
 ## 015.3Sum (Medium)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/3sum/  
+题目：https://leetcode.com/problems/3sum/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/016.3Sum_Closest/readme.md

@@ -1,7 +1,7 @@
 ## 016.3Sum_Closest (Medium)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/3sum-closest/  
+题目：https://leetcode.com/problems/3sum-closest/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/017.Letter_Combinations_of_a_Phone_Number/readme.md

@@ -1,7 +1,7 @@
 ## 017.Letter_Combinations_of_a_Phone_Number
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/letter-combinations-of-a-phone-number/  
+题目：https://leetcode.com/problems/letter-combinations-of-a-phone-number/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/018.4Sum/readme.md

@@ -1,7 +1,7 @@
 ## 018.4Sum (Medium)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/4sum/  
+题目：https://leetcode.com/problems/4sum/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/019.Remove_Nth_Node_From_End_of_List/readme.md

@@ -1,7 +1,7 @@
 ## 019.Remove_Nth_Node_From_End_of_List (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/remove-nth-node-from-end-of-list/  
+题目：https://leetcode.com/problems/remove-nth-node-from-end-of-list/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/020.Valid_Parentheses/readme.md

@@ -1,7 +1,7 @@
 ## 020.Valid_Parentheses (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/valid-parentheses/  
+题目：https://leetcode.com/problems/valid-parentheses/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/021.Merge_Two_Sorted_Lists/readme.md

@@ -1,7 +1,7 @@
 ## 021.Merge_Two_Sorted_Lists (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/merge-two-sorted-lists/  
+题目：https://leetcode.com/problems/merge-two-sorted-lists/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/022.Generate_Parentheses/readme.md

@@ -1,7 +1,7 @@
 ## 022.Generate_Parentheses (Medium)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/generate-parentheses/  
+题目：https://leetcode.com/problems/generate-parentheses/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/023.Merge_k_Sorted_Lists/readme.md

@@ -1,7 +1,7 @@
 ## 023. Merge k Sorted Lists (Hard)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/merge-k-sorted-lists/  
+题目：https://leetcode.com/problems/merge-k-sorted-lists/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/024.Swap_Nodes_in_Pairs/readme.md

@@ -1,7 +1,7 @@
 ## 024. Swap Nodes in Pairs (Medium)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/swap-nodes-in-pairs/  
+题目：https://leetcode.com/problems/swap-nodes-in-pairs/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/025.Reverse_Nodes_in_k-Group/readme.md

@@ -1,7 +1,7 @@
 ## 025. Reverse Nodes in k-Group (Hard)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/reverse-nodes-in-k-group/  
+题目：https://leetcode.com/problems/reverse-nodes-in-k-group/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/026.Remove_Duplicates_from_Sorted_Array/readme.md

@@ -1,7 +1,7 @@
 ## 026. Remove Duplicates from Sorted Array (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/  
+题目：https://leetcode.com/problems/remove-duplicates-from-sorted-array/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/027.Remove_Element/readme.md

@@ -1,7 +1,7 @@
 ## 027. Remove Element (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/remove-element/  
+题目：https://leetcode.com/problems/remove-element/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/028.Implement_strStr()/readme.md

@@ -1,7 +1,7 @@
 ## 028. Implement strStr() (Easy)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/implement-strstr/  
+题目：https://leetcode.com/problems/implement-strstr/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/029.Divide_Two_Integers/readme.md

@@ -1,7 +1,7 @@
 ## 029. Divide Two Integers (Medium)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/divide-two-integers/  
+题目：https://leetcode.com/problems/divide-two-integers/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/030.Substring_with_Concatenation_of_All_Words/readme.md

@@ -1,7 +1,7 @@
 ## 030. Substring with Concatenation of All Words (Hard)  
 
 ### **链接**：  
-题目：https://oj.leetcode.com/problems/substring-with-concatenation-of-all-words/    
+题目：https://leetcode.com/problems/substring-with-concatenation-of-all-words/    
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：  
@@ -14,7 +14,7 @@
 这样的算法复杂度是 O(n*m)，其实还有几种很酷的 O(n) 的算法：  
 
 1. 跟[「076. Minimum Window Substring (Hard)」](https://github.com/illuz/leetcode/blob/master/solutions/079.Word_Search) 一样的思路，就是维护两个指针，分别为前后区间，和一个 map，跑前面的指针看看当前区间能不能恰好匹配，行的话就得到答案了。  
-2. 还有个用神奇的 `map<string, queue>` 来做，其实原理是跟 1 是一样的，具体见：[code with HashTable with Queue for O(n) runtime](https://oj.leetcode.com/discuss/21598/my-c-code-with-hashtable-with-queue-for-runtime-71ms-runtime)  
-3. 这其实只是一个优化，在匹配时使用 Trie 匹配，具体见：[Accepted recursive solution using Trie Tree](https://oj.leetcode.com/discuss/20055/accepted-recursive-solution-using-trie-tree)  
+2. 还有个用神奇的 `map<string, queue>` 来做，其实原理是跟 1 是一样的，具体见：[code with HashTable with Queue for O(n) runtime](https://leetcode.com/discuss/21598/my-c-code-with-hashtable-with-queue-for-runtime-71ms-runtime)  
+3. 这其实只是一个优化，在匹配时使用 Trie 匹配，具体见：[Accepted recursive solution using Trie Tree](https://leetcode.com/discuss/20055/accepted-recursive-solution-using-trie-tree)  
 
 这里用 C++ 实现了 O(n*m) 算法，用 Java 实现了 1 算法。  

Diff for: solutions/031.Next_Permutation/readme.md

@@ -1,7 +1,7 @@
 ## 031. Next Permutation (Medium)  
 
 ### **链接**：  
-题目：https://oj.leetcode.com/problems/next-permutation/  
+题目：https://leetcode.com/problems/next-permutation/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：  

Diff for: solutions/032.Longest_Valid_Parentheses/readme.md

@@ -1,7 +1,7 @@
 ## 032. Longest Valid Parentheses (Hard)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/longest-valid-parentheses/  
+题目：https://leetcode.com/problems/longest-valid-parentheses/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/068.Text_Justification/readme.md

@@ -1,7 +1,7 @@
 ## 068.Text_Justification (Hard)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/text-justification/  
+题目：https://leetcode.com/problems/text-justification/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/076.Minimum_Window_Substring/readme.md

@@ -1,7 +1,7 @@
 ## 076. Minimum Window Substring (Hard)
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/minimum-window-substring/  
+题目：https://leetcode.com/problems/minimum-window-substring/  
 代码(github)：https://github.com/illuz/leetcode
 
 ### **题意**：

Diff for: solutions/084.Largest_Rectangle_in_Histogram/readme.md

@@ -1,7 +1,7 @@
 ## 084. Largest Rectangle in Histogram (Hard)  
 
 ### **链接**：  
-题目：https://oj.leetcode.com/problems/largest-rectangle-in-histogram/  
+题目：https://leetcode.com/problems/largest-rectangle-in-histogram/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：  

Diff for: solutions/085.Maximal_Rectangle/readme.md

@@ -1,7 +1,7 @@
 ## 085. Maximal Rectangle (Hard)  
 
 ### **链接**：  
-题目：https://oj.leetcode.com/problems/maximal-rectangle/  
+题目：https://leetcode.com/problems/maximal-rectangle/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：  

Diff for: solutions/087.Scramble_String/readme.md

@@ -1,7 +1,7 @@
 ## 087. Scramble String (Hard)  
 
 ### **链接**：  
-题目：https://oj.leetcode.com/problems/scramble-string/  
+题目：https://leetcode.com/problems/scramble-string/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：  

Diff for: solutions/093.Restore_IP_Addresses/readme.md

@@ -1,7 +1,7 @@
 ## 093.Restore_IP_Addresses
 
 ### **链接**：
-题目：https://oj.leetcode.com/problems/restore-ip-addresses/  
+题目：https://leetcode.com/problems/restore-ip-addresses/  
 代码(github)：https://github.com/illuz/leetcode  
 
 ### **题意**：