rename cpp

Author: codename1995

README.md

@@ -19,25 +19,25 @@ LeetCode solution (C++ and Python)
 # Leetcode Hot & Top
 | Leetcode  | Solution  | Basic idea   |
 | ---       | ---       |  ---         |
-| 001 [Two Sum](https://leetcode-cn.com/problems/two-sum/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/1_Two_Sum/1_Two_Sum.cpp), [Python](https://github.com/codename1995/leetcodehub/blob/master/python/1.two_sum.py) | 1. Hashtable store the index
+| 001 [Two Sum](https://leetcode-cn.com/problems/two-sum/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/001_Two_Sum/001_Two_Sum.cpp), [Python](https://github.com/codename1995/leetcodehub/blob/master/python/1.two_sum.py) | 1. Hashtable store the index
 | 002 [Add Two Numbers](https://leetcode-cn.com/problems/add-two-numbers/) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/002_Add_Two_Numbers/002_Add_Two_Numbers.cpp) | 
-| 003 [Longest Substring without Repeating Characters](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/)| [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/3_Longest_Substring_Without_Repeating_Characters/3_Longest_Substring_Without_Repeating_Characters.cpp) | HastTable + TwoPointer
-005 [Longest Palindromic Substring](https://leetcode-cn.com/problems/longest-palindromic-substring/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/5_Longest_Palindromic_Substring/5_Longest_Palindromic_Substring.cpp) | 1. 中心扩展
-010 [Regular Expression Matching](https://leetcode-cn.com/problems/regular-expression-matching/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/10_Regular_Expression_Matching/10_Regular_Expression_Matching.cpp) | 1. 二维布尔型数组，dp[i][j]表示s[i:]与p[j:]匹配
-| 019 [Remove Nth Node From End of List](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/) | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/19_Remove_Nth_Node_from_End_of_List/19_Remove_Nth_Node_from_End_of_List.cpp) |
-| 021 [Merge Two Sorted Lists](https://leetcode-cn.com/problems/merge-two-sorted-lists/) | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/21_Merge_Two_Sorted_Lists/21_Merge_Two_Sorted_Lists.cpp)  | 
+| 003 [Longest Substring without Repeating Characters](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/)| [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/003_Longest_Substring_Without_Repeating_Characters/003_Longest_Substring_Without_Repeating_Characters.cpp) | HastTable + TwoPointer
+005 [Longest Palindromic Substring](https://leetcode-cn.com/problems/longest-palindromic-substring/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/005_Longest_Palindromic_Substring/005_Longest_Palindromic_Substring.cpp) | 1. 中心扩展
+010 [Regular Expression Matching](https://leetcode-cn.com/problems/regular-expression-matching/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/010_Regular_Expression_Matching/010_Regular_Expression_Matching.cpp) | 1. 二维布尔型数组，dp[i][j]表示s[i:]与p[j:]匹配
+| 019 [Remove Nth Node From End of List](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/) | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/019_Remove_Nth_Node_from_End_of_List/019_Remove_Nth_Node_from_End_of_List.cpp) |
+| 021 [Merge Two Sorted Lists](https://leetcode-cn.com/problems/merge-two-sorted-lists/) | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/021_Merge_Two_Sorted_Lists/021_Merge_Two_Sorted_Lists.cpp)  | 
 | 028 [Implement Strstr](https://leetcode-cn.com/problems/implement-strstr/) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/028_Implement_Strstr/028_Implement_Strstr.cpp) | 1. 基础字符串匹配，O(mn)，超时 <br> 2. KMP
-034 [Find First and Last Position of Element in Sorted Array](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/)| [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/34_Find_First_And_Last_Position_Of_Element_In_Sorted_Array/34_Find_First_And_Last_Position_Of_Element_In_Sorted_Array.cpp )| 1. 两次二分，分别返回 不大于/大于 target的第一个位置。需要注意两次二分的细节差异和确定返回位置是否在数组范围内。
-| 046 [Permutations ](https://leetcode-cn.com/problems/permutations/) (unique number) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/46_Permutations/46_Permutations.cpp)  | 1. DFS+标记 |
-| 047 [Permutations ii ](https://leetcode-cn.com/problems/permutations-ii/) (maybe duplicate)| [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/47_Permutations_II/47_Permutations_II.cpp) | 1. DFS+标记+剪枝
-| 050 [Pow(x, n)](https://leetcode-cn.com/problems/powx-n/)  | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/50_Pow/50_Pow.cpp)   | 1. 注意考虑特殊情况和溢出 |
-| 053 [Maximum  Subarray](https://leetcode-cn.com/problems/maximum-subarray/) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/53_Maximum_Subarray/53_Maximum_Subarray.cpp)| 1. DP |
-| 054 [Spiral Matrix](https://leetcode-cn.com/problems/spiral-matrix/)  | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/54_Spiral_Matrix/54_Spiral_Matrix.cpp)  | 1. 死循环依次缩减四个边界(up, right, bottom, left)并添加元素，边界越界退出循环
+034 [Find First and Last Position of Element in Sorted Array](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/)| [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/034_Find_First_And_Last_Position_Of_Element_In_Sorted_Array/034_Find_First_And_Last_Position_Of_Element_In_Sorted_Array.cpp )| 1. 两次二分，分别返回 不大于/大于 target的第一个位置。需要注意两次二分的细节差异和确定返回位置是否在数组范围内。
+| 046 [Permutations ](https://leetcode-cn.com/problems/permutations/) (unique number) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/046_Permutations/046_Permutations.cpp)  | 1. DFS+标记 |
+| 047 [Permutations ii ](https://leetcode-cn.com/problems/permutations-ii/) (maybe duplicate)| [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/047_Permutations_II/047_Permutations_II.cpp) | 1. DFS+标记+剪枝
+| 050 [Pow(x, n)](https://leetcode-cn.com/problems/powx-n/)  | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/050_Pow/050_Pow.cpp)   | 1. 注意考虑特殊情况和溢出 |
+| 053 [Maximum  Subarray](https://leetcode-cn.com/problems/maximum-subarray/) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/053_Maximum_Subarray/053_Maximum_Subarray.cpp)| 1. DP |
+| 054 [Spiral Matrix](https://leetcode-cn.com/problems/spiral-matrix/)  | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/054_Spiral_Matrix/054_Spiral_Matrix.cpp)  | 1. 死循环依次缩减四个边界(up, right, bottom, left)并添加元素，边界越界退出循环
 | 062 [Unique Paths](https://leetcode-cn.com/problems/unique-paths/ ) | [Python](https://github.com/codename1995/leetcodehub/blob/master/python/62_Unique_Paths.py) | 1. DP 
-| 064 [Minimum Path Sum](https://leetcode-cn.com/problems/minimum-path-sum/) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/64_Minimum_Path_Sum/64_Minimum_Path_Sum.cpp) | 1. DP|
-070 [Climbing Stairs](https://leetcode-cn.com/problems/climbing-stairs/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/70_Climbing_Stairs/70_Climbing_Stairs.cpp) | 1. DP|
-| 079 [Word Search](https://leetcode-cn.com/problems/word-search/)  | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/79_Word_Search/79_Word_Search.cpp)  | 1. DFS+Backtracking
-091 [Decode Ways](https://leetcode-cn.com/problems/decode-ways/)| [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/91_Decode_Ways/91_Decode_Ways.cpp) | 1. DP
+| 064 [Minimum Path Sum](https://leetcode-cn.com/problems/minimum-path-sum/) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/064_Minimum_Path_Sum/064_Minimum_Path_Sum.cpp) | 1. DP|
+070 [Climbing Stairs](https://leetcode-cn.com/problems/climbing-stairs/ ) | [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/070_Climbing_Stairs/070_Climbing_Stairs.cpp) | 1. DP|
+| 079 [Word Search](https://leetcode-cn.com/problems/word-search/)  | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/079_Word_Search/079_Word_Search.cpp)  | 1. DFS+Backtracking
+091 [Decode Ways](https://leetcode-cn.com/problems/decode-ways/)| [C++](https://github.com/codename1995/leetcodehub/blob/master/cpp/091_Decode_Ways/091_Decode_Ways.cpp) | 1. DP
 | 101 [Symmetric Tree](https://leetcode-cn.com/problems/symmetric-tree/)  | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/101_Symmetric_Tree/101_Symmetric_Tree.cpp)  | 1. 递归辅助函数`isMirror(root, root)`
 | 102 [Binary Tree Level Order Traversal](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/)| [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/102_Binary_Tree_Level_Order_Traversal/102_Binary_Tree_Level_Order_Traversal.cpp)| 1. 配合队列做呗，加两个计数器变量，一个比较队列是否输出了这一层的所有结点，一个用于记录下一层共有多少结点
 | 103 [Binary Tree Zigzag Level Order Traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/) | [C++](https://github.com/codename1995/LeetCodeHub/blob/master/cpp/103_Binary_Tree_Zigzag_Level_Order_Traversal/103_Binary_Tree_Zigzag_Level_Order_Traversal.cpp) | 1. 同102

cpp/002_Add_Two_Numbers/002_Add_Two_Numbers.cpp

@@ -0,0 +1,54 @@
+#include<iostream>
+
+using namespace std;
+
+ struct ListNode {
+	int val;
+	ListNode* next;
+	ListNode(int x) : val(x), next(NULL) {}
+	
+};
+ /**
+  * Definition for singly-linked list.
+  * struct ListNode {
+  *     int val;
+  *     ListNode *next;
+  *     ListNode(int x) : val(x), next(NULL) {}
+  * };
+  */
+ class Solution {
+ public:
+	 ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
+		 int carry = 0;
+		 ListNode* head = l1;
+		 ListNode* curr = l1;
+		 while (l1 && l2) {
+			 int v1 = 0, v2 = 0;
+			 if (v1) {
+				 v1 = l1->val;
+				 l1 = l1->next;
+			 }
+			 if (v2) {
+				 v2 = l2->val;
+				 l2 = l2->next;
+			 }
+			 curr->val = (v1 + v2 + carry) % 10;
+			 carry = (v1 + v2 + carry) / 10;
+
+			 if (l1 && l2) {
+				 curr->next = l1;
+				 curr = curr->next;
+			 }
+			 else if (!l1) {
+				 curr->next = l2;
+				 break;
+			 }
+			 else if (!l2) {
+				 curr->next = l1;
+				 break;
+			 }
+		 }
+
+		 return head;
+	 }
+ };

cpp/028_Implement_Strstr/028_Implement_Strstr.cpp

@@ -0,0 +1,29 @@
+#include<string>
+#include<iostream>
+
+using namespace std;
+
+class Solution {
+public:
+	int strStr(string haystack, string needle) {
+		// 2. KMP
+
+
+		// 1. 基础字符串匹配，O(mn)，超时
+		if (needle.size() == 0) return 0;
+		bool flag = true;
+		for (int i = 0; i < haystack.size(); ++i) {
+			flag = true;
+			int j = 0;
+			for (; j < needle.size(); ++j) {
+				if ((i + j) < haystack.size() && needle[j] != haystack[i + j]) {
+					flag = false;
+					break;
+				}
+			}
+			if (i + j <= haystack.size() && flag) return i;
+			flag = false;
+		}
+		return -1;
+	}
+};

cpp/10_Regular_Expression_Matching/10_Regular_Expression_Matching.cpp renamed to cpp/10_Regular_Expression_Matching/010_Regular_Expression_Matching.cpp

@@ -0,0 +1,23 @@
+#include <string>
+#include <iostream>
+#include <vector>
+#include <iterator>
+#include <algorithm>
+#include <stack>
+#include <random>
+#include <numeric>
+#include <iomanip>
+#include <map>
+#include <cmath>
+#include <cstring>
+
+using namespace std;
+
+const int negative_inf = INT_MIN + 10;
+
+class Solution {
+public:
+	int maxProfit(int k, vector<int>& prices) {
+
+	}
+};