Felixgitcode
diff --git a/‎2019.11.15/暮成雪.md renamed to ‎2018.11.15/暮成雪.md b/‎2019.11.15/暮成雪.md renamed to ‎2018.11.15/暮成雪.md
diff --git a/‎2019.11.24/Felix.md renamed to ‎2018.11.19-leetcode15/Felix.md
Lines changed: 2 additions & 0 deletions b/‎2019.11.24/Felix.md renamed to ‎2018.11.19-leetcode15/Felix.md
Lines changed: 2 additions & 0 deletions
diff --git a/‎2018.11.19-leetcode15/Istoryforever.md
Lines changed: 46 additions & 0 deletions b/‎2018.11.19-leetcode15/Istoryforever.md
Lines changed: 46 additions & 0 deletions
diff --git a/‎2019.11.24/ELF renamed to ‎2018.11.24-leetcode28/ELF b/‎2019.11.24/ELF renamed to ‎2018.11.24-leetcode28/ELF
diff --git a/‎2019.11.24/TheRocket renamed to ‎2018.11.24-leetcode28/TheRocket b/‎2019.11.24/TheRocket renamed to ‎2018.11.24-leetcode28/TheRocket
diff --git a/‎2019.11.24/WhiteNight.md renamed to ‎2018.11.24-leetcode28/WhiteNight.md b/‎2019.11.24/WhiteNight.md renamed to ‎2018.11.24-leetcode28/WhiteNight.md
diff --git a/‎2019.11.24/kiritocly renamed to ‎2018.11.24-leetcode28/kiritocly b/‎2019.11.24/kiritocly renamed to ‎2018.11.24-leetcode28/kiritocly
diff --git a/‎2019.11.24/乔戈里.md renamed to ‎2018.11.24-leetcode28/乔戈里.md b/‎2019.11.24/乔戈里.md renamed to ‎2018.11.24-leetcode28/乔戈里.md
diff --git a/‎2018.11.24-leetcode28/大魔王爱穿孖烟筒.md
Lines changed: 30 additions & 0 deletions b/‎2018.11.24-leetcode28/大魔王爱穿孖烟筒.md
Lines changed: 30 additions & 0 deletions
diff --git a/‎2019.11.24/妮可.md renamed to ‎2018.11.24-leetcode28/妮可.md b/‎2019.11.24/妮可.md renamed to ‎2018.11.24-leetcode28/妮可.md
@@ -1,3 +1,4 @@
+```
 import java.util.Arrays;
 
 /**
@@ -28,3 +29,4 @@ public class ThreeSumClosest {
 		return res;
 	}
 }
+```
@@ -0,0 +1,46 @@
+leetcode of 15
+```
+class Solution {
+public:
+    vector<vector<int>> threeSum(vector<int>& nums) {
+       
+        vector<vector<int>> res;
+        if(nums.size()==0) return res;
+        sort(nums.begin(),nums.end());
+        int i=0;
+        int p=0;
+        int q=0;
+        while(i<nums.size()-2){
+            if(i>0 &&nums[i-1]==nums[i]){
+                i++;
+                continue;
+            }
+            if(nums[i]>0) break;
+           int  diff=0-nums[i];
+            p=i+1;
+            q=nums.size()-1;
+            while(p<q){
+                if(nums[p]+nums[q]<diff && p<q) p++;
+                if(nums[p]+nums[q]>diff && p<q) q--;
+                else if(p<q && nums[p]+nums[q]==diff){
+                   vector<int>temp;
+                    temp.push_back(nums[i]);
+                    temp.push_back(nums[p]);
+                    temp.push_back(nums[q]);
+                    res.push_back(temp);
+                    p++;
+                    q--;
+                    while(p<q &&nums[p]==nums[p-1]){
+                        p++;
+                    }
+                    while(p<q &&nums[q]==nums[q+1]){
+                        q--;
+                    }
+                }
+            }
+            i++;
+        }
+        return res;
+    }
+};
+```
@@ -0,0 +1,30 @@
+class Solution {
+    public int strStr(String haystack, String needle) {
+        if(needle.length()==0){
+           return 0; 
+        }
+        char [] hay=haystack.toCharArray();
+        char [] nde=needle.toCharArray();
+        
+        for(int i=0;i<hay.length;i++){
+            
+            if(hay[i]==nde[0]){ //遇到相同的情况
+                int j=i+1;//指针j比较i的下一个元素与needle是否相同
+                int k=1; //指针k遍历needle数组，从第二个开始比较，第一个已经判断相同的情况下才进入的。
+                for(;k<nde.length&&j<hay.length;k++){
+                    if(hay[j]==nde[k]){//如果下一个元素还相同
+                       j++; //则比较haystack的下一个
+                    }else{
+                        break;//很快遇到不同的则退出。
+                    }
+                }
+                if(k==nde.length){
+                   return i; 
+                }
+            }
+        }
+        
+        return -1;
+        
+    }
+}
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	+```
`1`	`2`	`import java.util.Arrays;`
`2`	`3`
`3`	`4`	`/**`
`@@ -28,3 +29,4 @@ public class ThreeSumClosest {`
`28`	`29`	`return res;`
`29`	`30`	`}`
`30`	`31`	`}`
	`32`	+```