From 83f884f5a43cdcd621b8561bb2367a2e1feb9d30 Mon Sep 17 00:00:00 2001
From: JZFamily <hao931126@126.com>
Date: Sun, 24 Jun 2018 12:19:19 +0800
Subject: [PATCH] =?UTF-8?q?Update=20=E5=88=B7=E9=A2=98.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 LeetCode-CN/刷题.md | 116 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 116 insertions(+)

diff --git a/LeetCode-CN/刷题.md b/LeetCode-CN/刷题.md
index 727f43f..b07519f 100644
--- a/LeetCode-CN/刷题.md
+++ b/LeetCode-CN/刷题.md
@@ -573,5 +573,121 @@ public:
     }
 };
 ```
+# 28. 实现strStr() @2018/06/23
 
+### jzf
+
+* 第一版 4ms
+
+```c++ 
+class Solution {
+public:
+    int strStr(string haystack, string needle) {
+        string::iterator ihay;
+        string::iterator inee;
+        int ni =haystack.size();
+        int nn =needle.size();
+        int ret = -1;
+        
+        if(nn==0)
+        {
+            return 0;
+        }
+        if(ni<nn)
+        {
+            return -1;
+        }
+        for(size_t i=0;i<ni-nn+1;i++)
+        {
+            if(!(haystack.substr(i,nn)).compare(needle))
+            {
+                ret =i;
+                break;
+            }
+        }
+        
+        return ret;
+    }
+};
+```
+
+### 羽柔子
+
+```c++
+class Solution {
+public:
+    int strStr(string haystack, string needle) {
+        if(needle.size()==0)return 0;
+        if(haystack.size()<needle.size())return -1;
+        size_t 
+            i,j,
+            ilen=haystack.size()-needle.size(),
+            jlen=needle.size(); 
+        for( i = 0; i <= ilen; i++){
+            for( j = 0; j < jlen; j++)
+                if(haystack[i+j]!=needle[j])
+                    goto A;
+            return i;
+            A:;
+        }
+        return -1;
+    }
+};
+
+```
+
+### puck
+
+```c++
+class Solution
+{
+  public:
+    int strStr(string haystack, string needle)
+    {
+        std::size_t size_a{haystack.size()};
+        std::size_t size_b{needle.size()};
+
+        if (0 == size_b)
+        {
+            return 0;
+        }
+
+        bool flag{};
+
+        for (int i{}; i < size_a; ++i)
+        {
+            if (haystack.at(i) == needle.at(0))
+            {
+                flag = true;
+
+                for (int j{1}; j < size_b; ++j)
+                {
+                    if (i + j >= size_a || haystack.at(i + j) != needle.at(j))
+                    {
+                        flag = false;
+                        break;
+                    }
+                }
+
+                if (flag)
+                {
+                    return i;
+                }
+            }
+        }
+
+        return -1;
+    }
+};
+```
+### 北河
+## 823. Binary Trees With Factors@2018/06/23
+
+## 196. 删除重复的电子邮箱@2018/06/23
+
+### 北河
+* 
+```sql
+delete from Person where id in (select c.id from (select a.id from Person a  join Person b on a.Email = b.Email and a.Id > b.Id) c);
+```