diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..a94212f
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,9 @@
+################################################################################
+# 此 .gitignore 文件已由 Microsoft(R) Visual Studio 自动创建。
+################################################################################
+
+*.suo
+*.db
+*.opendb
+*.json
+*.sqlite
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index 659275b..d2a73e8 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,13 +2,10 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="002d486d-1798-40f2-9583-b4b7183c0076" name="Default" comment="配置">
-      <change afterPath="$PROJECT_DIR$/muchenchen/best_time_to_stocks/__init__.py" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/muchenchen/best_time_to_stocks/best_time_to_stocks.py" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/muchenchen/best_time_to_stocks/readme.md" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/muchenchen/readme.md" beforeDir="false" afterPath="$PROJECT_DIR$/muchenchen/readme.md" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/woyaoyangguang/readme.md" beforeDir="false" />
     </list>
     <option name="EXCLUDED_CONVERTED_TO_IGNORED" value="true" />
+    <option name="TRACKING_ENABLED" value="true" />
     <option name="SHOW_DIALOG" value="false" />
     <option name="HIGHLIGHT_CONFLICTS" value="true" />
     <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
@@ -16,15 +13,72 @@
   </component>
   <component name="FileEditorManager">
     <leaf SIDE_TABS_SIZE_LIMIT_KEY="300">
-      <file pinned="false" current-in-tab="true">
+      <file leaf-file-name="best_time_to_stocks.py" pinned="false" current-in-tab="false">
         <entry file="file://$PROJECT_DIR$/muchenchen/best_time_to_stocks/best_time_to_stocks.py">
           <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="41">
-              <caret line="29" lean-forward="true" selection-start-line="29" selection-end-line="29" />
+            <state relative-caret-position="511">
+              <caret line="29" selection-start-line="29" selection-end-line="29" />
             </state>
           </provider>
         </entry>
       </file>
+      <file leaf-file-name="README.md" pinned="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/卖萌粉松鼠/README.md">
+          <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+            <state split_layout="SPLIT">
+              <first_editor />
+              <second_editor />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="反转字符串.md" pinned="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/卖萌粉松鼠/反转字符串/反转字符串.md">
+          <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+            <state split_layout="SPLIT">
+              <first_editor />
+              <second_editor />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="readme.md" pinned="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/woyaoyangguang/delete_duplicate/readme.md">
+          <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+            <state split_layout="SPLIT">
+              <first_editor />
+              <second_editor />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="readme.md" pinned="false" current-in-tab="true">
+        <entry file="file://$PROJECT_DIR$/woyaoyangguang/add one/readme.md">
+          <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+            <state split_layout="SPLIT">
+              <first_editor />
+              <second_editor />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="readme.md" pinned="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/Spareribs/readme.md">
+          <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+            <state split_layout="SPLIT">
+              <first_editor />
+              <second_editor />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="add_one.py" pinned="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/woyaoyangguang/add one/add_one.py">
+          <provider selected="true" editor-type-id="text-editor">
+            <state relative-caret-position="-124" />
+          </provider>
+        </entry>
+      </file>
     </leaf>
   </component>
   <component name="FileTemplateManagerImpl">
@@ -58,10 +112,10 @@
     <packageJsonPaths />
   </component>
   <component name="ProjectFrameBounds" extendedState="6">
-    <option name="x" value="415" />
-    <option name="y" value="137" />
+    <option name="x" value="1997" />
+    <option name="y" value="78" />
     <option name="width" value="1400" />
-    <option name="height" value="1000" />
+    <option name="height" value="972" />
   </component>
   <component name="ProjectView">
     <navigator proportions="" version="1">
@@ -79,13 +133,18 @@
             <path>
               <item name="learning-algorithm" type="b2602c69:ProjectViewProjectNode" />
               <item name="learning-algorithm" type="462c0819:PsiDirectoryNode" />
-              <item name="muchenchen" type="462c0819:PsiDirectoryNode" />
+              <item name="Spareribs" type="462c0819:PsiDirectoryNode" />
             </path>
             <path>
               <item name="learning-algorithm" type="b2602c69:ProjectViewProjectNode" />
               <item name="learning-algorithm" type="462c0819:PsiDirectoryNode" />
-              <item name="muchenchen" type="462c0819:PsiDirectoryNode" />
-              <item name="best_time_to_stocks" type="462c0819:PsiDirectoryNode" />
+              <item name="woyaoyangguang" type="462c0819:PsiDirectoryNode" />
+            </path>
+            <path>
+              <item name="learning-algorithm" type="b2602c69:ProjectViewProjectNode" />
+              <item name="learning-algorithm" type="462c0819:PsiDirectoryNode" />
+              <item name="woyaoyangguang" type="462c0819:PsiDirectoryNode" />
+              <item name="add one" type="462c0819:PsiDirectoryNode" />
             </path>
           </expand>
           <select />
@@ -100,6 +159,12 @@
     <property name="nodejs_npm_path_reset_for_default_project" value="true" />
     <property name="settings.editor.selected.configurable" value="com.jetbrains.python.configuration.PyActiveSdkModuleConfigurable" />
   </component>
+  <component name="RecentsManager">
+    <key name="CopyFile.RECENT_KEYS">
+      <recent name="$PROJECT_DIR$/woyaoyangguang" />
+      <recent name="$PROJECT_DIR$/woyaoyangguang/delete_duplicate" />
+    </key>
+  </component>
   <component name="RunDashboard">
     <option name="ruleStates">
       <list>
@@ -125,14 +190,12 @@
       <option name="IS_MODULE_SDK" value="true" />
       <option name="ADD_CONTENT_ROOTS" value="true" />
       <option name="ADD_SOURCE_ROOTS" value="true" />
+      <EXTENSION ID="PythonCoverageRunConfigurationExtension" runner="coverage.py" />
       <option name="SCRIPT_NAME" value="$PROJECT_DIR$/muchenchen/best_time_to_stocks/best_time_to_stocks.py" />
       <option name="PARAMETERS" value="" />
       <option name="SHOW_COMMAND_LINE" value="false" />
       <option name="EMULATE_TERMINAL" value="false" />
       <option name="MODULE_MODE" value="false" />
-      <option name="REDIRECT_INPUT" value="false" />
-      <option name="INPUT_FILE" value="" />
-      <method v="2" />
     </configuration>
     <recent_temporary>
       <list>
@@ -162,44 +225,50 @@
     <servers />
   </component>
   <component name="ToolWindowManager">
-    <frame x="-8" y="-8" width="1936" height="1056" extended-state="6" />
+    <frame x="1997" y="78" width="1400" height="972" extended-state="0" />
     <editor active="true" />
     <layout>
-      <window_info active="true" content_ui="combo" id="Project" order="0" visible="true" weight="0.24973656" />
-      <window_info id="Structure" order="1" side_tool="true" weight="0.25" />
-      <window_info id="Favorites" order="2" side_tool="true" />
-      <window_info anchor="bottom" id="Message" order="0" />
-      <window_info anchor="bottom" id="Find" order="1" />
-      <window_info anchor="bottom" id="Run" order="2" visible="true" weight="0.11388286" />
-      <window_info anchor="bottom" id="Debug" order="3" weight="0.4" />
-      <window_info anchor="bottom" id="Cvs" order="4" weight="0.25" />
-      <window_info anchor="bottom" id="Inspection" order="5" weight="0.4" />
       <window_info anchor="bottom" id="TODO" order="6" />
-      <window_info anchor="bottom" id="Docker" order="7" show_stripe_button="false" />
-      <window_info anchor="bottom" id="Database Changes" order="8" show_stripe_button="false" />
-      <window_info anchor="bottom" id="Terminal" order="9" />
       <window_info anchor="bottom" id="Event Log" order="10" side_tool="true" weight="0.329718" />
+      <window_info anchor="bottom" id="Database Changes" order="8" show_stripe_button="false" />
+      <window_info anchor="bottom" id="Run" order="2" weight="0.11388286" />
       <window_info anchor="bottom" id="Version Control" order="11" weight="0.329718" />
       <window_info anchor="bottom" id="Python Console" order="12" weight="0.329718" />
+      <window_info anchor="bottom" id="Terminal" order="9" />
+      <window_info active="true" content_ui="combo" id="Project" order="0" visible="true" weight="0.33726066" />
+      <window_info anchor="bottom" id="Docker" order="7" show_stripe_button="false" />
+      <window_info anchor="right" id="Database" order="4" />
+      <window_info anchor="right" id="SciView" order="3" />
+      <window_info id="Structure" order="1" side_tool="true" weight="0.25" />
+      <window_info anchor="bottom" id="Debug" order="3" weight="0.4" />
+      <window_info id="Favorites" order="2" side_tool="true" />
+      <window_info anchor="right" content_ui="combo" id="Hierarchy" order="2" weight="0.25" />
+      <window_info anchor="bottom" id="Inspection" order="5" weight="0.4" />
       <window_info anchor="right" id="Commander" internal_type="SLIDING" order="0" type="SLIDING" weight="0.4" />
       <window_info anchor="right" id="Ant Build" order="1" weight="0.25" />
-      <window_info anchor="right" content_ui="combo" id="Hierarchy" order="2" weight="0.25" />
-      <window_info anchor="right" id="SciView" order="3" />
-      <window_info anchor="right" id="Database" order="4" />
+      <window_info anchor="bottom" id="Message" order="0" />
+      <window_info anchor="bottom" id="Cvs" order="4" weight="0.25" />
+      <window_info anchor="bottom" id="Find" order="1" />
     </layout>
   </component>
   <component name="TypeScriptGeneratedFilesManager">
     <option name="version" value="1" />
   </component>
+  <component name="VcsContentAnnotationSettings">
+    <option name="myLimit" value="2678400000" />
+  </component>
   <component name="VcsManagerConfiguration">
     <MESSAGE value="配置" />
     <option name="LAST_COMMIT_MESSAGE" value="配置" />
   </component>
   <component name="editorHistoryManager">
-    <entry file="file://$PROJECT_DIR$/muchenchen/delete_duplicates/delete_duplicates.py">
-      <provider selected="true" editor-type-id="text-editor" />
+    <entry file="file://$PROJECT_DIR$/muchenchen/best_time_to_stocks/best_time_to_stocks.py">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="522">
+          <caret line="29" lean-forward="true" selection-start-line="29" selection-end-line="29" />
+        </state>
+      </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/woyaoyangguang/delete_duplicate/readme.md" />
     <entry file="file://$PROJECT_DIR$/muchenchen/readme.md">
       <provider selected="true" editor-type-id="text-editor">
         <state relative-caret-position="66">
@@ -214,9 +283,6 @@
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/muchenchen/delete_duplicates/readme.md">
-      <provider selected="true" editor-type-id="text-editor" />
-    </entry>
     <entry file="file://$PROJECT_DIR$/muchenchen/best_time_to_stocks/readme.md">
       <provider selected="true" editor-type-id="text-editor">
         <state>
@@ -231,23 +297,64 @@
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/Spareribs/readme.md">
-      <provider selected="true" editor-type-id="text-editor" />
+    <entry file="file://$PROJECT_DIR$/Spareribs/53 merge_two_sorted_lists/Readme.md" />
+    <entry file="file://$PROJECT_DIR$/muchenchen/best_time_to_stocks/best_time_to_stocks.py">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="511">
+          <caret line="29" selection-start-line="29" selection-end-line="29" />
+        </state>
+      </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/Spareribs/53 merge_two_sorted_lists/Readme.md">
+    <entry file="file://$PROJECT_DIR$/woyaoyangguang/readme.md">
       <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
-        <state split_layout="FIRST">
-          <first_editor relative-caret-position="1485">
-            <caret line="45" column="19" lean-forward="true" selection-start-line="45" selection-start-column="19" selection-end-line="45" selection-end-column="19" />
-          </first_editor>
+        <state split_layout="SPLIT">
+          <first_editor />
           <second_editor />
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/muchenchen/best_time_to_stocks/best_time_to_stocks.py">
+    <entry file="file://$PROJECT_DIR$/卖萌粉松鼠/README.md">
+      <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+        <state split_layout="SPLIT">
+          <first_editor />
+          <second_editor />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/卖萌粉松鼠/反转字符串/反转字符串.md">
+      <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+        <state split_layout="SPLIT">
+          <first_editor />
+          <second_editor />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/woyaoyangguang/delete_duplicate/readme.md">
+      <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+        <state split_layout="SPLIT">
+          <first_editor />
+          <second_editor />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/Spareribs/readme.md">
+      <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+        <state split_layout="SPLIT">
+          <first_editor />
+          <second_editor />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/woyaoyangguang/add one/add_one.py">
       <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="41">
-          <caret line="29" lean-forward="true" selection-start-line="29" selection-end-line="29" />
+        <state relative-caret-position="-124" />
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/woyaoyangguang/add one/readme.md">
+      <provider selected="true" editor-type-id="split-provider[text-editor;markdown-preview-editor]">
+        <state split_layout="SPLIT">
+          <first_editor />
+          <second_editor />
         </state>
       </provider>
     </entry>
diff --git "a/HughGuo/Leetcode-02/C003_\346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.py" "b/HughGuo/Leetcode-02/C003_\346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.py"
new file mode 100644
index 0000000..c90a041
--- /dev/null
+++ "b/HughGuo/Leetcode-02/C003_\346\227\240\351\207\215\345\244\215\345\255\227\347\254\246\347\232\204\346\234\200\351\225\277\345\255\220\344\270\262.py"
@@ -0,0 +1,18 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s):
+        """
+        :type s: str
+        :rtype: int
+        """
+        temp = 0
+        d = {}
+        start = 0
+        for i in range(len(s)):
+            if s[i] in d and start <= d[s[i]] :
+                start = d[s[i]] +1
+            temp = max(i-start+1,temp)
+            d[s[i]] = i
+        return temp
+
+## 维护两个字符串，一个是当前最大的字符串l，一个是当前字符串t，最初的时候这两个字符串都为空。每扫一个字符，如果这个字符不在字符串当中，就把当前字符串加上这个字符。如果在，当前字符串就不能再往前加字符了，然后比较当前字符串和当前最大字符串。再把当前字符串的开始地址替换掉因为不能有重复元素，##麻烦
+## 滑动窗口！ 机智！
diff --git a/HughGuo/readme.md b/HughGuo/readme.md
index d6aa085..5d3aedf 100644
--- a/HughGuo/readme.md
+++ b/HughGuo/readme.md
@@ -1,3 +1,4 @@
 # HughGuo贡献内容
 
-- 两数求和
\ No newline at end of file
+- #2. 两数求和
+- #3. 无重复字符的最长子串
diff --git a/LeafScar/expressive_words/expressive_words.cpp b/LeafScar/expressive_words/expressive_words.cpp
new file mode 100644
index 0000000..8d82840
--- /dev/null
+++ b/LeafScar/expressive_words/expressive_words.cpp
@@ -0,0 +1,48 @@
+#include <vector>
+
+using namespace std;
+
+class Solution {
+public:
+	int expressiveWords(string S, std::vector<string>& words) {
+		int num = 0;
+		for (int i = 0; i < words.size(); ++i)
+		{
+			if (expressiveWord(S, words[i]))
+				num++;
+		}
+		return num;
+	}
+
+	bool expressiveWord(string s, string t)
+	{
+		int s_i = 0;
+		int t_i = 0;
+
+		while (s_i < s.length() && t_i < t.length())
+		{
+			if (s[s_i] != t[t_i])
+				return false;
+
+			int s_flag = 0;
+			while (s[s_i] == t[t_i])
+			{
+				s_i++;
+				s_flag++;
+			}
+
+			int t_flag = 0;
+			while (s[s_i - 1] == t[t_i])
+			{
+				t_flag++;
+				t_i++;
+			}
+
+			if (t_flag == s_flag  || (s_flag >= 3 && t_flag <= s_flag))
+				continue;
+
+			return false;
+		}
+		return s_i == s.length() && t_i == t.length();
+	}
+};
diff --git a/LeafScar/expressive_words/file.png b/LeafScar/expressive_words/file.png
new file mode 100644
index 0000000..b28dcca
Binary files /dev/null and b/LeafScar/expressive_words/file.png differ
diff --git a/LeafScar/expressive_words/readme.md b/LeafScar/expressive_words/readme.md
new file mode 100644
index 0000000..88a7245
--- /dev/null
+++ b/LeafScar/expressive_words/readme.md
@@ -0,0 +1,93 @@
+# LeetCode 809������зḻ������
+### ��Ŀ
+&emsp;&emsp;��ʱ�����ǻ��ö������ĸ����ʾ�������У����� "hello" -> "heeellooo", "hi" -> "hiii"�����ǽ���������ͬ����ĸ���飬�������������ĸ������ͬ�����ǽ�һ��ӵ��������������ĸ���鶨��Ϊ����״̬��extended�������һ�������е� "e" ��" o" �Լ��ڶ��������е� "i"�� ���⣬"abbcccaaaa" ���з��� "a" , "bb" , "ccc" , "dddd"������ "ccc" �� "aaaa" ��������״̬��
+
+&emsp;&emsp;����һ���������ַ��� S �������һ�������ܹ�ͨ����һЩ��ĸ�����ŴӶ�ʹ��� S ��ͬ�����ǽ�������ʶ���Ϊ�����ŵģ�stretchy������������ѡ��һ����ĸ�飨�������ĸ c ����Ȼ��������������ͬ����ĸ c ʹ�䳤�ȴﵽ 3 �����ϡ�ע�⣬���Dz��ܽ�һ��ֻ����һ����ĸ����ĸ�飬�� "h"�����ŵ�һ������������ĸ���飬�� "hh"�����е����ű���ʹ����ĸ��������״̬�����ٰ���������ĸ����
+
+&emsp;&emsp;����һ�鵥�ʣ�������п����ŵĵ���������
+
+**ʾ����**  
+**���룺**  
+```
+S = "heeellooo"
+words = ["hello", "hi", "helo"]
+```
+**�����** 
+```
+1
+```
+**���ͣ�**  
+������ͨ������"hello"��"e"��"o"���õ�"heeellooo"��
+���Dz���ͨ������"helo"���õ�"heeellooo"��Ϊ"ll"����������״̬��
+
+
+**˵����**
+* 0 <= len(S) <= 100��
+* 0 <= len(words) <= 100��
+* 0 <= len(words[i]) <= 100��
+* S �������� words �еĵ��ʶ�ֻ��Сд��ĸ��ɡ�
+
+### ˼·
+
+**����Ŀ�����⣺**
+* ������״̬��ԭ���ʵĵ�����ĸ�������ִ���������󵥴ʶ�Ӧ���������ִ������
+* ����״̬��ԭ���ʵĵ�����ĸ�������ִ���������󵥴ʶ�Ӧ��ĸ���Ƚϣ�����󵥴ʶ�Ӧ��ĸ�������ִ�������ԭ���ʵĵ�����ĸ�������ִ������ұ������3��
+
+**ʵ���뷨��**
+
+ԭ����������󵥴�˳��ɨ�裬��¼������ĸ�������ִ������ֱ��Ϊt_flag��s_flag��
+![File](file.png)
+1. ���˳��ɨ��ʱ������������ĸ��ԭ������ĸ��ͬ��ֱ�ӷ���false��
+2. t_flag����s_flag ���� ��s_flag���ڵ���3 �� s_flag��ֵ����t_flag��ֵ���Ž�����һ����ĸ���жϣ�
+3. ֱ������һ������ɨ�����������һ�����ʻ�δɨ���꣬��һ����false;
+
+**����ʵ�֣�**
+```
+bool expressiveWord(string s, string t)
+{
+	int s_i = 0;    // ���䵥��ɨ�赽���±�
+	int t_i = 0;    // ԭ����ɨ�赽���±�
+
+	while (s_i < s.length() && t_i < t.length())
+	{
+		if (s[s_i] != t[t_i])
+			return false;
+
+		int s_flag = 0;
+		while (s[s_i] == t[t_i])    // ��¼���䵥����ĸ�����ó��ִ���
+		{
+			s_i++;
+			s_flag++;
+		}
+
+		int t_flag = 0;
+		while (s[s_i - 1] == t[t_i])    // ��¼ԭ������ĸ�����ó��ִ���
+		{
+			t_flag++;
+			t_i++;
+		}
+
+		if (t_flag == s_flag  || (s_flag >= 3 && t_flag <= s_flag))
+			continue;
+
+		return false;
+	}
+	return s_i == s.length() && t_i == t.length();
+}
+
+// ����ȥ���DZ������鵥�ʣ���¼������ϸ������䵥�ʵ�ԭ���ʵ�����
+int expressiveWords(string S, std::vector<string>& words) {
+	int num = 0;
+	for (int i = 0; i < words.size(); ++i)
+	{
+		if (expressiveWord(S, words[i]))
+			num++;
+	}
+	return num;
+}
+```
+
+
+
+
+
diff --git a/ParkFeng/random_pick_with_weight/Learn1.java b/ParkFeng/random_pick_with_weight/Learn1.java
new file mode 100644
index 0000000..6624755
--- /dev/null
+++ b/ParkFeng/random_pick_with_weight/Learn1.java
@@ -0,0 +1,43 @@
+
+class Solution {
+
+    int[] arr;
+    int maxOfArr;
+    Random random = new Random();
+    public Solution(int[] w) {
+        arr = new int[w.length];
+        arr[0] = w[0];
+        for (int i = 1; i <arr.length; i++) {
+            arr[i] = arr[i-1]+w[i];
+        }
+        maxOfArr = arr[arr.length-1];
+    }
+
+    public int pickIndex() {
+        int rand = random.nextInt(maxOfArr)+1;
+        int index = findIndex(arr, rand);
+        return index;
+    }
+
+    private int findIndex(int[] nums, int m) {
+        int start = 0;
+        int end = nums.length-1;
+        while (start+1 < end) {
+            int mid = (start+end)/2;
+            if (nums[mid] == m) {
+                return mid;
+            } else if (nums[mid] < m) {
+                start = mid+1;
+            } else {
+                end = mid-1;
+            }
+        }
+        if (m > nums[end]) {
+            return end+1;
+        } else if (m > nums[start]) {
+            return start+1;
+        } else {
+            return start;
+        }
+    }
+}
\ No newline at end of file
diff --git a/ParkFeng/random_pick_with_weight/readme.md b/ParkFeng/random_pick_with_weight/readme.md
new file mode 100644
index 0000000..9199e8d
--- /dev/null
+++ b/ParkFeng/random_pick_with_weight/readme.md
@@ -0,0 +1,41 @@
+题目：
+
+给定一个正整数数组 w ，其中 w[i] 代表位置 i 的权重，请写一个函数 pickIndex ，它可以随机地获取位置 i，
+选取位置 i 的概率与 w[i] 成正比。
+
+说明:
+
+1 <= w.length <= 10000
+1 <= w[i] <= 10^5
+pickIndex 将被调用不超过 10000 次
+示例1:
+
+输入: 
+["Solution","pickIndex"]
+[[[1]],[]]
+输出: [null,0]
+示例2:
+
+输入: 
+["Solution","pickIndex","pickIndex","pickIndex","pickIndex","pickIndex"]
+[[[1,3]],[],[],[],[],[]]
+输出: [null,0,1,1,1,0]
+输入语法说明：
+
+输入是两个列表：调用成员函数名和调用的参数。Solution 的构造函数有一个参数，即数组 w。
+               pickIndex 没有参数。输入参数是一个列表，即使参数为空，也会输入一个 [] 空列表。
+               
+
+题目分析：
+
+1、该题针对：正整数数组---权重数组
+
+2、权重随机理解：
+eg: int[] arr = {3,4}--->向上抛一个硬币（假设硬币落地一定是平躺）7次，出现正面反面的次数（权重）分别为3,4，那么就可以说这个实验中正面出现概率是
+3/7，反面出现概率是4/7，回到已知的这个数组上，3+4=7，权重随机我们可以理解为一个箱子中有七个分别标有1~7数字的乒乓球，我们随机从
+箱子中每次拿一个乒乓球，那么拿到标有1，2，3的乒乓球我们就认为对应的是数组中的3，拿到4，5，6，7就对应的是4
+
+3、获取位置序号：利用二分法去查找
+
+
+
diff --git a/ParkFeng/readme.md b/ParkFeng/readme.md
index 48ff99f..e1d1353 100644
--- a/ParkFeng/readme.md
+++ b/ParkFeng/readme.md
@@ -2,4 +2,6 @@
 
 
 
-1.对角线遍历分析
\ No newline at end of file
+1.对角线遍历分析
+
+2.按权重随机选择
\ No newline at end of file
diff --git a/QianHu/LeetCode/33-SearchInRotatedSortedArray/__init__.py b/QianHu/LeetCode/33-SearchInRotatedSortedArray/__init__.py
new file mode 100644
index 0000000..7c68785
--- /dev/null
+++ b/QianHu/LeetCode/33-SearchInRotatedSortedArray/__init__.py
@@ -0,0 +1 @@
+# -*- coding: utf-8 -*-
\ No newline at end of file
diff --git a/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex1.jpeg b/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex1.jpeg
new file mode 100644
index 0000000..90a9527
Binary files /dev/null and b/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex1.jpeg differ
diff --git a/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex2.jpeg b/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex2.jpeg
new file mode 100644
index 0000000..cd153e3
Binary files /dev/null and b/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex2.jpeg differ
diff --git a/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex3.jpeg b/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex3.jpeg
new file mode 100644
index 0000000..f67c511
Binary files /dev/null and b/QianHu/LeetCode/33-SearchInRotatedSortedArray/img_ex3.jpeg differ
diff --git a/QianHu/LeetCode/33-SearchInRotatedSortedArray/main.py b/QianHu/LeetCode/33-SearchInRotatedSortedArray/main.py
new file mode 100644
index 0000000..45f29a1
--- /dev/null
+++ b/QianHu/LeetCode/33-SearchInRotatedSortedArray/main.py
@@ -0,0 +1,39 @@
+# -*- coding: utf-8 -*-
+
+
+class Solution(object):
+    def search(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: int
+        """
+        low = 0
+        high = len(nums)
+        while low < high:
+            mid = (low + high) // 2
+            if target == nums[mid]:
+                return mid
+            if nums[mid] < nums[low]:
+                if target < nums[mid] or target >= nums[low]:
+                    high = mid
+                else:
+                    low = mid + 1
+            elif nums[mid] > nums[high - 1]:
+                if target > nums[mid] or target < nums[low]:
+                    low = mid + 1
+                else:
+                    high = mid
+            else:
+                if target > nums[mid]:
+                    low = mid + 1
+                else:
+                    high = mid
+        return -1
+
+
+if __name__ == '__main__':
+    solution = Solution()
+    nums = [8, 1, 2, 3, 4, 5, 6, 7]
+    target = 6
+    assert solution.search(nums, target) == 6
diff --git a/QianHu/LeetCode/33-SearchInRotatedSortedArray/readme.md b/QianHu/LeetCode/33-SearchInRotatedSortedArray/readme.md
new file mode 100644
index 0000000..24da487
--- /dev/null
+++ b/QianHu/LeetCode/33-SearchInRotatedSortedArray/readme.md
@@ -0,0 +1,147 @@
+# LeetCode - 33. Search in Rotated Sorted Array
+
+link: [https://leetcode.com/problems/search-in-rotated-sorted-array/](https://leetcode.com/problems/search-in-rotated-sorted-array/)
+
+## 题目
+
+Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
+
+(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
+
+You are given a target value to search. If found in the array return its index, otherwise return -1.
+
+You may assume no duplicate exists in the array.
+
+Your algorithm's runtime complexity must be in the order of O(log n).
+
+Example 1:
+```
+Input: nums = [4,5,6,7,0,1,2], target = 0
+Output: 4
+Example 2:
+```
+
+```
+Input: nums = [4,5,6,7,0,1,2], target = 3
+Output: -1
+```
+Accepted 334,119  Submissions 1,033,865
+
+
+
+## 题目来源与背景故事
+
+LeetCode上一道Medium题目，2018年1月面试Face++ Python后端开发时遇到过一样的题目，当时回答的不好，一直在纠结C点的位置关系；在参加2018年清华大学研究生入学考试，计算机基础知识综合912中，也遇到了类似的题目，那道题目和此题略有区别，将下图中的BC交换了，实际是一个类似y = 1 - |x|形状，即AC段单调递增，CB段单调递减，这题比较简单，所以回答的还可以
+
+
+
+
+## 问题描述
+
+给定一个有序数组，将其中前面部分，放至后面，在这样的数组中查找特定值，要求复杂度O(log N)
+
+![ex1](img_ex1.jpeg)
+
+## 题目分析
+此题目实际是是一个二分查找的应用，需要对原先二分查找的基础上修改条件判断
+
+我们将low设置为A处，high设置在B处（右侧），mid的位置就很关键了，mid可能会落在AC之间，也可能在CB之间，接下来分情况考虑，更定输入nums，查找目标target
+
+
+
+### 1. mid恰好就是target所在位置
+
+这是最理想的情况，也是循环结束的条件之一
+
+
+
+### 2. mid落在[A, C)之间
+
+![ex2](img_ex2.jpeg)
+
+此时，mid的特点是，nums[C] < nums[B] < nums[low] <= nums[mid] <= nums[C] 
+
+####  2.1 target位于[low, mid)之间 
+
+此时如果target位于[low, mid)，那么target的特点是，nums[low] <= nums[target] < nums[mid]，此时target位于完全有序的[low, mid)区间，退化成了一个标准的二分查找
+
+#### 2.2 target位于(mid, high)之间
+
+此时如果target位于位于(mid, high)之间，此时退化成一个规模更小的旋转数组查找，此时target有两种情况
+
+- 位于(mid, C)之间，此时target的特点是nums[mid] < target && nums[low] < target
+- 位于[C, B)之间，此时target特点是nums[mid] > target && nums[low] > target 
+
+
+
+### 3. mid落在[C, B)之间
+
+![ex3](img_ex3.jpeg)
+
+此时，mid的特点是，nums[C]  <= nums[low] <= nums[B] < nums[mid] < nums[C] 
+
+#### 2.1 target位于[low, mid)之间
+
+此时如果target位于[low, mid)，那么target的特点是， nums[target] < nums[low] < nums[mid]，此时退化成一个规模更小的旋转数组查找，此时target有两种情况
+
+- 位于[low, C)之间，此时target的特点是nums[mid] < target &&  target >= nums[low]
+- 位于[C, mid)之间，此时target特点是nums[mid] > target && nums[low] > target 
+
+#### 2.2 target位于(mid, high)之间
+
+此时如果target位于(mid, high)，那么target的特点是，nums[mid] < nums[target] < nums[high]，此时target位于完全有序的(mid, high)区间，退化成了一个标准的二分查找
+
+
+
+## 代码实现
+
+```python
+# -*- coding: utf-8 -*-
+
+
+class Solution(object):
+    def search(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: int
+        """
+        low = 0
+        high = len(nums)
+        while low < high:
+            mid = (low + high) // 2
+            if target == nums[mid]:
+                return mid
+            if nums[mid] < nums[low]:
+                if target < nums[mid] or target >= nums[low]:
+                    high = mid
+                else:
+                    low = mid + 1
+            elif nums[mid] > nums[high - 1]:
+                if target > nums[mid] or target < nums[low]:
+                    low = mid + 1
+                else:
+                    high = mid
+            else:
+                if target > nums[mid]:
+                    low = mid + 1
+                else:
+                    high = mid
+        return -1
+
+
+if __name__ == '__main__':
+    solution = Solution()
+    nums = [8, 1, 2, 3, 4, 5, 6, 7]
+    target = 6
+    assert solution.search(nums, target) == 6
+
+```
+
+
+
+## 运行结果
+
+| Time Submitted | Status                                   | Runtime | Language |
+| -------------- | ---------------------------------------- | ------- | -------- |
+| a day ago      | [Accepted](https://leetcode.com/submissions/detail/193848779/) | 24 ms   | python   |
\ No newline at end of file
diff --git a/QianHu/LeetCode/__init__.py b/QianHu/LeetCode/__init__.py
new file mode 100644
index 0000000..7c68785
--- /dev/null
+++ b/QianHu/LeetCode/__init__.py
@@ -0,0 +1 @@
+# -*- coding: utf-8 -*-
\ No newline at end of file
diff --git a/QianHu/readme.md b/QianHu/readme.md
index f596e64..e1bab37 100644
--- a/QianHu/readme.md
+++ b/QianHu/readme.md
@@ -1,4 +1,7 @@
 # QianHu贡献内容
 
-1.真二叉树重构
+## Tsinghua DS MOOC
+### 1.真二叉树重构（ProperRebuild）
 
+## LeetCode
+### 33.Search in Rotated Sorted Array
diff --git a/Spareribs/53 merge_two_sorted_lists/Readme.md b/Spareribs/0053 merge_two_sorted_lists/Readme.md
similarity index 100%
rename from Spareribs/53 merge_two_sorted_lists/Readme.md
rename to Spareribs/0053 merge_two_sorted_lists/Readme.md
diff --git a/Spareribs/readme.md b/Spareribs/readme.md
index 1bebbee..c316253 100644
--- a/Spareribs/readme.md
+++ b/Spareribs/readme.md
@@ -2,5 +2,5 @@
 
 ## 难度简单
 
-53 最大子序和 merge_two_sorted_lists [点击跳转](https://github.com/spareribs/learning-algorithm/tree/master/Spareribs/53%20merge_two_sorted_lists)
+53 最大子序和 merge_two_sorted_lists [点击跳转](https://github.com/guangcity/learning-algorithm/tree/master/Spareribs/0053%20merge_two_sorted_lists)
 
diff --git "a/SugarChl/xuanzhuanSort/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274_1.c" "b/SugarChl/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274_1.c"
similarity index 100%
rename from "SugarChl/xuanzhuanSort/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274_1.c"
rename to "SugarChl/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274_1.c"
diff --git "a/SugarChl/xuanzhuanSort/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274_2.c" "b/SugarChl/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274_2.c"
similarity index 100%
rename from "SugarChl/xuanzhuanSort/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274_2.c"
rename to "SugarChl/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274_2.c"
diff --git "a/SugarChl/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274/readme.md" "b/SugarChl/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274/readme.md"
new file mode 100644
index 0000000..25a9059
--- /dev/null
+++ "b/SugarChl/153. \345\257\273\346\211\276\346\227\213\350\275\254\346\216\222\345\272\217\346\225\260\347\273\204\344\270\255\347\232\204\346\234\200\345\260\217\345\200\274/readme.md"	
@@ -0,0 +1,6 @@
+寻找旋转排序数组中的最小值
+
+153. 寻找旋转排序数组中的最小值_1.c  是完全自己写的代码
+
+153. 寻找旋转排序数组中的最小值_2.c  是网络上找到的代码
+
diff --git "a/SugarChl/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/221.\346\234\200\345\244\247\346\255\243\346\226\271\345\275\242.c" "b/SugarChl/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/221.\346\234\200\345\244\247\346\255\243\346\226\271\345\275\242.c"
new file mode 100644
index 0000000..109fa4c
--- /dev/null
+++ "b/SugarChl/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/221.\346\234\200\345\244\247\346\255\243\346\226\271\345\275\242.c"	
@@ -0,0 +1,38 @@
+int min(int a,int b)
+{
+    if(a>b)
+        return b;
+    else
+        return a;
+}
+
+
+int maximalSquare(char** matrix, int matrixRowSize, int matrixColSize) {
+    int row,col;
+    int max=0;
+    int m[1000][1000];
+    
+    for(row=0;row<matrixRowSize;row++)
+    {
+        for(col=0;col<matrixColSize;col++)
+        {
+            if(matrix[row][col]=='1')
+                m[row+1][col+1]=1;
+            else
+                m[row+1][col+1]=0;
+        }
+    }
+    for(row=0;row<=matrixRowSize;row++)
+    {
+        for(col=0;col<=matrixColSize;col++)
+        {
+            if(m[row][col]==1)
+            {
+                m[row][col] = min(min(m[row][col-1],m[row-1][col]),m[row-1][col-1])+1;
+            }
+            if(m[row][col]>max)
+                max=m[row][col];
+        }
+    }
+    return max*max;
+}
diff --git "a/SugarChl/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/readme.md" "b/SugarChl/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/readme.md"
new file mode 100644
index 0000000..d63a9c5
--- /dev/null
+++ "b/SugarChl/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/readme.md"	
@@ -0,0 +1,4 @@
+# 解题思路
+
+	参考了网络上的答案，
+	使用动态规划的方法。
\ No newline at end of file
diff --git "a/SugarChl/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/5.\346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262.c" "b/SugarChl/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/5.\346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262.c"
new file mode 100644
index 0000000..6e0349c
--- /dev/null
+++ "b/SugarChl/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/5.\346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262.c"	
@@ -0,0 +1,59 @@
+#include<string.h>
+char* longestPalindrome(char* s) {
+    int len = strlen(s);
+    int n = 2*len-1;
+    int i;
+    int max=0;
+    int left = 0;
+    int right = 0;
+    int L=0,R=0;
+    for(i=0;i<n;i++)
+    {
+        if(i%2==0)
+        {
+            int index = i/2;
+            L=index-1;
+            R=index+1;
+            while(L>=0&&R<len&&s[L]==s[R])
+            {
+                L--;
+                R++;
+            }
+            L++;
+            R--;
+            if(R-L>max)
+            {
+                max=R-L;
+                right=R;
+                left=L;
+            }
+        }
+        else if(i%2==1)
+        {
+            L=(i-1)/2;
+            R=(i+1)/2;
+            while(L>=0&&R<len&&s[L]==s[R])
+            {
+                L--;
+                R++;
+            }
+            L++;
+            R--;
+            if(R-L>max)
+            {
+                max=R-L;
+                right=R;
+                left=L;
+            }
+        }
+    }
+    char *p=malloc(1000*sizeof('x'));
+    int k=0;
+    for(i=left;i<=right;i++)
+    {
+        //printf("%c",s[i]);
+        p[k++]=s[i];
+    }
+    p[k]='\0';
+    return p;
+}
\ No newline at end of file
diff --git "a/SugarChl/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/readme.md" "b/SugarChl/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/readme.md"
new file mode 100644
index 0000000..d63a9c5
--- /dev/null
+++ "b/SugarChl/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/readme.md"	
@@ -0,0 +1,4 @@
+# 解题思路
+
+	参考了网络上的答案，
+	使用动态规划的方法。
\ No newline at end of file
diff --git a/SugarChl/readme.md b/SugarChl/readme.md
index ba27de3..7194579 100644
--- a/SugarChl/readme.md
+++ b/SugarChl/readme.md
@@ -8,3 +8,6 @@
 
 153. 寻找旋转排序数组中的最小值_2.c  是网络上找到的代码
 
+5.最长回文子串
+
+221.最大正方形
\ No newline at end of file
diff --git "a/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/221.\346\234\200\345\244\247\346\255\243\346\226\271\345\275\242.c" "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/221.\346\234\200\345\244\247\346\255\243\346\226\271\345\275\242.c"
new file mode 100644
index 0000000..109fa4c
--- /dev/null
+++ "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/221.\346\234\200\345\244\247\346\255\243\346\226\271\345\275\242.c"	
@@ -0,0 +1,38 @@
+int min(int a,int b)
+{
+    if(a>b)
+        return b;
+    else
+        return a;
+}
+
+
+int maximalSquare(char** matrix, int matrixRowSize, int matrixColSize) {
+    int row,col;
+    int max=0;
+    int m[1000][1000];
+    
+    for(row=0;row<matrixRowSize;row++)
+    {
+        for(col=0;col<matrixColSize;col++)
+        {
+            if(matrix[row][col]=='1')
+                m[row+1][col+1]=1;
+            else
+                m[row+1][col+1]=0;
+        }
+    }
+    for(row=0;row<=matrixRowSize;row++)
+    {
+        for(col=0;col<=matrixColSize;col++)
+        {
+            if(m[row][col]==1)
+            {
+                m[row][col] = min(min(m[row][col-1],m[row-1][col]),m[row-1][col-1])+1;
+            }
+            if(m[row][col]>max)
+                max=m[row][col];
+        }
+    }
+    return max*max;
+}
diff --git "a/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/readme.md" "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/readme.md"
new file mode 100644
index 0000000..d63a9c5
--- /dev/null
+++ "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/221. \346\234\200\345\244\247\346\255\243\346\226\271\345\275\242/readme.md"	
@@ -0,0 +1,4 @@
+# 解题思路
+
+	参考了网络上的答案，
+	使用动态规划的方法。
\ No newline at end of file
diff --git "a/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/5.\346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262.c" "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/5.\346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262.c"
new file mode 100644
index 0000000..6e0349c
--- /dev/null
+++ "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/5.\346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262.c"	
@@ -0,0 +1,59 @@
+#include<string.h>
+char* longestPalindrome(char* s) {
+    int len = strlen(s);
+    int n = 2*len-1;
+    int i;
+    int max=0;
+    int left = 0;
+    int right = 0;
+    int L=0,R=0;
+    for(i=0;i<n;i++)
+    {
+        if(i%2==0)
+        {
+            int index = i/2;
+            L=index-1;
+            R=index+1;
+            while(L>=0&&R<len&&s[L]==s[R])
+            {
+                L--;
+                R++;
+            }
+            L++;
+            R--;
+            if(R-L>max)
+            {
+                max=R-L;
+                right=R;
+                left=L;
+            }
+        }
+        else if(i%2==1)
+        {
+            L=(i-1)/2;
+            R=(i+1)/2;
+            while(L>=0&&R<len&&s[L]==s[R])
+            {
+                L--;
+                R++;
+            }
+            L++;
+            R--;
+            if(R-L>max)
+            {
+                max=R-L;
+                right=R;
+                left=L;
+            }
+        }
+    }
+    char *p=malloc(1000*sizeof('x'));
+    int k=0;
+    for(i=left;i<=right;i++)
+    {
+        //printf("%c",s[i]);
+        p[k++]=s[i];
+    }
+    p[k]='\0';
+    return p;
+}
\ No newline at end of file
diff --git "a/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/readme.md" "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/readme.md"
new file mode 100644
index 0000000..d63a9c5
--- /dev/null
+++ "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/5. \346\234\200\351\225\277\345\233\236\346\226\207\345\255\220\344\270\262/readme.md"	
@@ -0,0 +1,4 @@
+# 解题思路
+
+	参考了网络上的答案，
+	使用动态规划的方法。
\ No newline at end of file
diff --git "a/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/readme.md" "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/readme.md"
new file mode 100644
index 0000000..a454c19
--- /dev/null
+++ "b/SugarChl/\345\212\250\346\200\201\350\247\204\345\210\222/readme.md"
@@ -0,0 +1,29 @@
+# 动态规划 个人归纳
+
+做了一些题目之后，就无法忍受暴力的方法来解题了。
+针对可以使用动态规划的题目，做一些总结，请各位大佬指正~
+
+
+当一个大规模问题可以被分解为小规模子问题，那么一般来说，这个问题就可以使用动态规划来求解。
+要使用动态规划，那么就要构建状态转移方程。
+“状态转移方程，是动态规划中本阶段的状态往往是上一阶段状态和上一阶段决策的结果”（来自百度百科）
+动态规划，是要将问题分解。
+那么，问题与子问题之间该怎么连接呢。
+这就要构建状态转移方程。
+
+
+## 221.最大正方形的问题。
+>选取矩阵中的一个点。x[i][j]
+>x点是否是最大正方形的右下角的点 与x[i-1][j] x[i][j-1] x[i-1][j-1]这三个点有关
+>①若DP[i-1][j]，DP[i][j-1]，DP[i-1][j-1]三者中存在0值，则DP[i][j]一定为0；
+>②若DP[i-1][j]，DP[i][j-1]，DP[i-1][j-1]均不为0，则DP[i][j]为三者中的最小值+1，因为三者中的最小值一定为三者所共有的不含0的部分，否则会造成缺角；
+
+>因此对于某一点(i,j), 若matrix[i][j]=1，则动态规划表达式为DP[i][j] = min{DP[i-1][j]，DP[i][j-1]，DP[i-1][j-1]} + 1;
+
+## 5.最长回文子串
+>对于字符串str，假设dp[i,j]=1表示str[i...j]是回文子串
+>那么dp[i+1,j-1] 也必然是回文子串
+>这样最长回文子串就被分解成了一系列规模小的子问题。这样就能求解了。	
+
+>状态转移方程： dp[i,j]={dp[i+1,j-1],str[i]==str[j];0,str[i]!=str[j]}
+	
diff --git a/leon/longsetSubString/longestSubString.cpp b/leon/longsetSubString/longestSubString.cpp
new file mode 100644
index 0000000..2e7b3d7
--- /dev/null
+++ b/leon/longsetSubString/longestSubString.cpp
@@ -0,0 +1,82 @@
+#include <string>
+#include <typeinfo>
+#include <vector>
+#include <algorithm>
+// #include<unordered_set>
+#include <iostream>
+using namespace std;
+class Solution
+{
+  public:
+    int lengthOfLongestSubstring(string s)
+    {
+        int max = 0;
+        int record = 0;
+        auto size = s.size();
+        // const char *p = s.data();
+        vector<char> myvector;
+
+        for (decltype(size) i = 0; i < size; i++)
+        {
+            char temp = s[i];
+
+            if (find(myvector.begin(), myvector.end(), temp) != myvector.end())
+            {
+                while (find(myvector.begin(), myvector.end(), temp) != myvector.end())
+                {
+                    // cout << *(myvector.end());
+                    cout << string("delete:") + *(myvector.begin()) << endl;
+                    myvector.erase(myvector.begin());
+                }
+                myvector.push_back(temp);
+                cout << string("insert:") + temp << endl;
+                record = myvector.size();
+                if (record > max)
+                {
+                    max = record;
+                }
+                for (auto i : myvector)
+                {
+                    cout << i << endl;
+                }
+            }
+            else
+            {
+                record++;
+                if (record > max)
+                {
+                    max = record;
+                }
+                cout << string("insert:") + temp << endl;
+                myvector.push_back(temp);
+                for (auto i : myvector)
+                {
+                    cout << i << endl;
+                }
+            }
+        }
+        // p = NULL;
+        // free((void *)p);
+
+        return max;
+    }
+};
+int main()
+{
+    string a = "bbbb";
+    Solution s;
+    int max = s.lengthOfLongestSubstring(a);
+    // cout << a;
+    cout << a << endl;
+    cout << max << endl;
+    // string a_2 = "ynyo";
+    // Solution s_2;
+    // int max_2 = s_2.lengthOfLongestSubstring(a_2);
+    // // cout << a;
+    // cout << a_2 << endl;
+    // cout << max_2;
+    // if (typeid(char).name() == typeid(decltype(a[0])).name())
+    //     cout << "true" << endl;
+
+    return 0;
+}
diff --git a/leon/longsetSubString/longestSubString.md b/leon/longsetSubString/longestSubString.md
new file mode 100644
index 0000000..d6bed09
--- /dev/null
+++ b/leon/longsetSubString/longestSubString.md
@@ -0,0 +1,106 @@
+### Problem
+
+Given a string, find the length of the longest substring without repeating characters.
+
+Example 1:
+
+```c++
+Input: "abcabcbb"
+Output: 3
+Explanation: The answer is "abc", with the length of 3.
+```
+
+Example 2:
+
+```c++
+Input: "bbbbb"
+Output: 1
+Explanation: The answer is "b", with the length of 1.
+```
+
+Example 3:
+
+```c++
+Input: "pwwkew"
+Output: 3
+Explanation: The answer is "wke", with the length of 3.
+             Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
+```
+
+### Answer
+
+```c++
+#include <string>
+#include <typeinfo>
+#include <vector>
+#include <algorithm>
+// #include<unordered_set>
+#include <iostream>
+using namespace std;
+class Solution
+{
+  public:
+    int lengthOfLongestSubstring(string s)
+    {
+        int max = 0;
+        int record = 0;
+        auto size = s.size();
+        // const char *p = s.data();
+        vector<char> myvector;
+
+        for (decltype(size) i = 0; i < size; i++)
+        {
+            char temp = s[i];
+
+            if (find(myvector.begin(), myvector.end(), temp) != myvector.end())
+            {
+                while (find(myvector.begin(), myvector.end(), temp) != myvector.end())
+                {
+                    // cout << *(myvector.end());
+                    // cout << string("delete:") + *(myvector.begin()) << endl;
+                    myvector.erase(myvector.begin());
+                }
+                myvector.push_back(temp);
+                // cout << string("insert:") + temp << endl;
+                record = myvector.size();
+                if (record > max)
+                {
+                    max = record;
+                }
+                // for (auto i : myvector)
+                // {
+                //     cout << i << endl;
+                // }
+            }
+            else
+            {
+                record++;
+                if (record > max)
+                {
+                    max = record;
+                }
+                // cout << string("insert:") + temp << endl;
+                myvector.push_back(temp);
+                // for (auto i : myvector)
+                // {
+                //     cout << i << endl;
+                // }
+            }
+        }
+        // p = NULL;
+        // free((void *)p);
+
+        return max;
+    }
+};
+```
+
+#### Using vector
+
+when I first saw the question,my opinion is to get the character of the string one by one.and use a data structure to store substring that meeting the requirements that adjacent element is different.Meanwhile,caculate the length of the storage.And assign the maximum value to the variable "max" .Finally,return max.
+
+#### Bug encountered
+
+1. the select of data structure.(I use vector,but I tried to use set which is completed by the red blacktrees.When using set,I met a bug that my substring will be sorted automatically so I change to vector.)
+2. Use FIFO(first in first out),so need push_back and erase(vec.begin());
+3. Finally,in the leetcode we can't cout too many contents;
\ No newline at end of file
diff --git a/miss-ann/add-two-number/al/al.c b/miss-ann/add-two-number/al/al.c
new file mode 100644
index 0000000..9d576bf
--- /dev/null
+++ b/miss-ann/add-two-number/al/al.c
@@ -0,0 +1,33 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     struct ListNode *next;
+ * };
+ */
+struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
+    struct ListNode *head=(struct ListNode *)malloc(sizeof(struct ListNode));//head用于返回新链表
+    struct ListNode *tail=head;
+    int sum,count=0; //sum用来存储当前位相加，若有进位则count=sum/10
+    while(l1!= NULL ||l2!=NULL){
+        int x = (l1!=NULL)?l1->val:0;
+        int y = (l2!=NULL)?l2->val:0;
+        int sum =count+x+y;
+        count=sum/10;
+        tail->next=(struct ListNode *)malloc(sizeof(struct ListNode));
+        tail =tail->next;
+        tail->val=sum%10;//相加后存储值为除去进位10
+        if(l1!=NULL) l1=l1->next;
+        if(l2!=NULL) l2=l2->next;
+    }
+    if(count>0){//判断最后一位是否需要进位
+        tail->next=(struct ListNode *)malloc(sizeof(struct ListNode));
+        tail=tail->next;
+        tail->val=count;
+    }
+    tail->next=NULL;
+    tail=head;
+    head=head->next;
+    free(tail);
+    return head;//返回头结点的下一节点
+    }
diff --git a/miss-ann/add-two-number/al/al.java b/miss-ann/add-two-number/al/al.java
new file mode 100644
index 0000000..b205fc8
--- /dev/null
+++ b/miss-ann/add-two-number/al/al.java
@@ -0,0 +1,29 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
+        ListNode dummyHead = new ListNode(0);
+    ListNode p = l1, q = l2, curr = dummyHead;
+    int carry = 0;
+    while (p != null || q != null) {
+        int x = (p != null) ? p.val : 0;
+        int y = (q != null) ? q.val : 0;
+        int sum = carry + x + y;
+        carry = sum / 10;
+        curr.next = new ListNode(sum % 10);
+        curr = curr.next;
+        if (p != null) p = p.next;
+        if (q != null) q = q.next;
+    }
+    if (carry > 0) {
+        curr.next = new ListNode(carry);
+    }
+    return dummyHead.next;
+    }
+}
diff --git a/miss-ann/add-two-number/al/al.py b/miss-ann/add-two-number/al/al.py
new file mode 100644
index 0000000..4814b75
--- /dev/null
+++ b/miss-ann/add-two-number/al/al.py
@@ -0,0 +1,28 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution:
+    def addTwoNumbers(self, l1, l2):
+        """
+        :type l1: ListNode
+        :type l2: ListNode
+        :rtype: ListNode
+        """
+        head = ListNode(0)
+        tail = head
+        count=0
+        while(l1 or l2):
+            x=l1.val if l1 else 0
+            y=l2.val if l2 else 0
+            s=count+x+y
+            count=s//10
+            tail.next=ListNode(s%10)
+            tail=tail.next
+            if(l1!=None): l1=l1.next
+            if(l2!=None): l2=l2.next
+        if(count>0):
+            tail.next=ListNode(1)
+        return head.next
diff --git a/miss-ann/add-two-number/readme.md b/miss-ann/add-two-number/readme.md
new file mode 100644
index 0000000..2874b28
--- /dev/null
+++ b/miss-ann/add-two-number/readme.md
@@ -0,0 +1,138 @@
+# 两数相加
+
+今天是小安开始Leetcode刷题的第二题，正文开始ing😎
+
+## 题目描述
+给出两个 **非空** 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 **逆序** 的方式存储的，并且它们的每个节点只能存储 **一位** 数字。
+如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。
+您可以假设除了数字 0 之外，这两个数都不会以 0 开头。[题目原址](https://leetcode-cn.com/problems/add-two-numbers/)
+**示例**
+> 输入：(2 -> 4 -> 3) + (5 -> 6 -> 4)
+> 输出：7 -> 0 -> 8
+> 原因：342 + 465 = 807
+
+## 方法：初等数学
+
+### 思想
+我们使用变量来跟踪进位，并从包含最低有效位的表头开始模拟逐位相加的过程。
+![两数相加的可视化：342+258=708](https://img-blog.csdnimg.cn/20181207210901837.png)
+如两数相加的可视化图所示，我们首先从最低有效位也就是列表 l1 和 l2 的表头开始相加。由于每位数字都应当处于 0...9 的范围内，我们计算两个数字的和时可能会出现“溢出”。例如，$5 + 7 = 12$ 。在这种情况下，我们会将当前位的数值设置为 sum%10，并将进位 $count =sum/10$ 带入下一次迭代。
+**请特别注意以下情况：**
+
+|测试用例  |说明  |
+|--|--|
+| l1=[0,1],l2=[0,1,2] |当一个列表比另一个列表长时。  |
+|   l1=[],l2=[0,1]|  当一个列表为空时，即出现空列表。|
+|l1=[9,9],l2=[1]|求和运算最后可能出现额外的进位，这一点很容易被遗忘 |
+### 代码实现
+【C实现】
+
+```
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     struct ListNode *next;
+ * };
+ */
+struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
+    struct ListNode *head=(struct ListNode *)malloc(sizeof(struct ListNode));//head用于返回新链表
+    struct ListNode *tail=head;
+    int sum,count=0; //sum用来存储当前位相加，若有进位则count=sum/10
+    while(l1!= NULL ||l2!=NULL){
+        int x = (l1!=NULL)?l1->val:0;
+        int y = (l2!=NULL)?l2->val:0;
+        int sum =count+x+y;
+        count=sum/10;
+        tail->next=(struct ListNode *)malloc(sizeof(struct ListNode));
+        tail =tail->next;
+        tail->val=sum%10;//相加后存储值为除去进位10
+        if(l1!=NULL) l1=l1->next;
+        if(l2!=NULL) l2=l2->next;
+    }
+    if(count>0){//判断最后一位是否需要进位
+        tail->next=(struct ListNode *)malloc(sizeof(struct ListNode));
+        tail=tail->next;
+        tail->val=count;
+    }
+    tail->next=NULL;
+    tail=head;
+    head=head->next;
+    free(tail);
+    return head;//返回头结点的下一节点
+    }
+```
+【Java实现】
+
+```
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
+        ListNode head = new ListNode(0);
+        ListNode tail = head;
+        int count = 0;
+    while (l1 != null || l2 != null) {
+        int x = (l1 != null) ? l1.val : 0;
+        int y = (l2 != null) ? l2.val : 0;
+        int sum = count + x + y;
+        count = sum / 10;
+        tail.next = new ListNode(sum % 10);
+        tail = tail.next;
+        if (l1 != null) l1 = l1.next;
+        if (l2 != null) l2 = l2.next;
+    }
+    if (count > 0) {
+        tail.next = new ListNode(count);
+    }
+    return head.next;
+        
+    }
+}
+```
+【python实现】
+
+```
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution:
+    def addTwoNumbers(self, l1, l2):
+        """
+        :type l1: ListNode
+        :type l2: ListNode
+        :rtype: ListNode
+        """
+        head = ListNode(0)
+        tail = head
+        count=0
+        while(l1 or l2):
+            x=l1.val if l1 else 0
+            y=l2.val if l2 else 0
+            s=count+x+y
+            count=s//10
+            tail.next=ListNode(s%10)
+            tail=tail.next
+            if(l1!=None): l1=l1.next
+            if(l2!=None): l2=l2.next
+        if(count>0):
+            tail.next=ListNode(1)
+        return head.next
+    
+```
+### 复杂度分析
+ - 时间复杂度：$O(max(m,n))$，假设 m 和 n分别表示 l1和 l2的长度，上面的算法最多重复 max(m, n)次。
+ - 空间复杂度： $O(max(m,n))$， 新列表的长度最多为max(m,n)+1。
+ 
+
+# Thanks
+一起加油哦~~
diff --git a/readme.md b/readme.md
index cb39dbb..313017c 100644
--- a/readme.md
+++ b/readme.md
@@ -27,8 +27,8 @@
 | 底层搬砖工     | [直通点](https://github.com/guangcity/learning-algorithm/tree/master/%E5%BA%95%E5%B1%82%E6%90%AC%E7%A0%96%E5%B7%A5) |
 | miss-ann       | [直通点](https://github.com/guangcity/learning-algorithm/tree/master/miss-ann) |
 | woyaoyangguang | [直通点](https://github.com/guangcity/learning-algorithm/tree/master/woyaoyangguang) |
-|                |                                                              |
-|                |                                                              |
+| 马晶敏         | [直通点](https://github.com/guangcity/learning-algorithm/tree/master/马晶敏) |
+| 刘广月         | [直通车](https://github.com/guangcity/learning-algorithm/tree/master/刘广月) |
 |                |                                                              |
 |                |                                                              |
 |                |                                                              |
diff --git a/woyaoyangguang/add one/add_one.py b/woyaoyangguang/add one/add_one.py
new file mode 100644
index 0000000..d120e1f
--- /dev/null
+++ b/woyaoyangguang/add one/add_one.py	
@@ -0,0 +1,46 @@
+'''
+给定一个由整数组成的非空数组所表示的非负整数，在该数的基础上加一。
+最高位数字存放在数组的首位， 数组中每个元素只存储一个数字。
+你可以假设除了整数 0 之外，这个整数不会以零开头。
+
+示例１：
+输入: [1,2,3]
+输出: [1,2,4]
+解释: 输入数组表示数字 123。
+'''
+
+'''
+思路：
+将数组转化为数字,当输入数组时,通过对其循环，将每一个数字按照位数提出，
+通过intNum=intNum*10+digits[i]　转化为对应顺位的数字,在此基础上
+加上下一位,达到要求’在此基础上加一’.接下来的思路是想到怎么将数字，转换
+为之前格式的数组，可以将数字转换为字符串，然后对其遍历，将对应位置上的
+数字放到列表当中。
+'''
+
+
+class Solution:
+    def plusOne(self,digits):
+        '''
+
+        :param digits: List[int]
+        :return: List[int]
+        '''
+        #数组转化为数字
+        intNum=0
+        for i in range(len(digits)):
+            intNum=intNum*10+digits[i]
+        intNum+=1
+        #数字转化为字符
+        strNum=str(intNum)
+        #字符转化为数组
+        res=[]
+        for i in range(len(strNum)):
+            res.append((int(strNum[i])))
+        return res
+
+
+
+a=Solution()
+b=a.plusOne([1,2,3,4])
+print(b)
\ No newline at end of file
diff --git a/woyaoyangguang/add one/readme.md b/woyaoyangguang/add one/readme.md
new file mode 100644
index 0000000..097d221
--- /dev/null
+++ b/woyaoyangguang/add one/readme.md	
@@ -0,0 +1,5 @@
+# 我要阳光　贡献内容
+
+
+
+1.加一  add_one
\ No newline at end of file
diff --git a/woyaoyangguang/readme.md b/woyaoyangguang/delete_duplicate/readme.md
similarity index 100%
rename from woyaoyangguang/readme.md
rename to woyaoyangguang/delete_duplicate/readme.md
diff --git "a/\345\210\230\345\271\277\346\234\210/21MergeTwoOrderedLists.py" "b/\345\210\230\345\271\277\346\234\210/21MergeTwoOrderedLists.py"
new file mode 100644
index 0000000..b8f4d26
--- /dev/null
+++ "b/\345\210\230\345\271\277\346\234\210/21MergeTwoOrderedLists.py"
@@ -0,0 +1,98 @@
+#!/user/bin/env python
+#-*- coding:utf-8 -*-
+# @Time    : 2018/12/6 21:18
+# @Author  : 刘
+# @Site    : 
+# @File    : 21MergeTwoOrderedLists.py
+# @Software: PyCharm
+
+
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+# Definition for singly-linked list.
+import json
+class ListNode:
+    def __init__(self, x):
+        self.val = x
+        self.next = None
+import json
+class Solution:
+    def mergeTwoLists(self, l1, l2):
+        """
+        :type l1: ListNode
+        :type l2: ListNode
+        :rtype: ListNode
+        """
+        if l1 == None and l2 == None:
+            return None
+        if l1 ==None:
+            return None
+        if l2== None:
+            return None
+        if l1.val <l2.val:
+            l1.next =self.mergeTwoLists(l1.next,l2)
+            return l1
+        else:
+            l2.next = self.mergeTwoLists(l1,l2.next)
+            return l2
+
+
+def stringToIntegerList(input):
+    return json.loads(input)
+
+
+def stringToListNode(input):
+    # Generate list from the input
+    numbers = stringToIntegerList(input)
+
+    # Now convert that list into linked list
+    dummyRoot = ListNode(0)
+    ptr = dummyRoot
+    for number in numbers:
+        ptr.next = ListNode(number)
+        ptr = ptr.next
+
+    ptr = dummyRoot.next
+    return ptr
+
+
+def listNodeToString(node):
+    if not node:
+        return "[]"
+
+    result = ""
+    while node:
+        result += str(node.val) + ", "
+        node = node.next
+    return "[" + result[:-2] + "]"
+
+
+def main():
+    import sys
+    import io
+    def readlines():
+        for line in io.TextIOWrapper(sys.stdin.buffer, encoding='utf-8'):
+            yield line.strip('\n')
+
+    lines = readlines()
+    while True:
+        try:
+            line = next(lines)
+            l1 = stringToListNode(line)
+            line = next(lines)
+            l2 = stringToListNode(line)
+
+            ret = Solution().mergeTwoLists(l1, l2)
+
+            out = listNodeToString(ret)
+            print(out)
+        except StopIteration:
+            break
+
+
+if __name__ == '__main__':
+    main()
\ No newline at end of file
diff --git "a/\345\210\230\345\271\277\346\234\210/\351\242\230\347\233\256\357\274\232\345\220\210\345\271\266\344\270\244\344\270\252\346\234\211\345\272\217\351\223\276\350\241\250.md" "b/\345\210\230\345\271\277\346\234\210/\351\242\230\347\233\256\357\274\232\345\220\210\345\271\266\344\270\244\344\270\252\346\234\211\345\272\217\351\223\276\350\241\250.md"
new file mode 100644
index 0000000..5e62dd8
--- /dev/null
+++ "b/\345\210\230\345\271\277\346\234\210/\351\242\230\347\233\256\357\274\232\345\220\210\345\271\266\344\270\244\344\270\252\346\234\211\345\272\217\351\223\276\350\241\250.md"
@@ -0,0 +1,20 @@
+# 题目：
+
+将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 
+
+**示例：**
+
+```html
+输入：1->2->4, 1->3->4
+输出：1->1->2->3->4->4
+```
+
+# 思想：
+
+1.确定是否两个链表是否含都为空链表
+
+2.在两个链表无空链表下确定第一个节点，比较链表1与链表2的第一个节点的值，将值小的节点保存下来为合并后的第一个节点。并且把第一个节点为最小的链表向后移动一个元素。
+
+3.继续在剩下的元素中选择小的值，连接到第一个结点后面，并不断next将值小的结点连接到第一个结点后面，直到某一个链表为空。
+
+4.当两个链表长度不一致时，也就是比较完成后其中一个链表为空，此时需要把另外一个链表剩下的元素都连接到第一个结点的后面。
\ No newline at end of file
diff --git "a/\345\272\225\345\261\202\346\220\254\347\240\226\345\267\245/letcode56.py" "b/\345\272\225\345\261\202\346\220\254\347\240\226\345\267\245/letcode56.py"
new file mode 100644
index 0000000..b1b4847
--- /dev/null
+++ "b/\345\272\225\345\261\202\346\220\254\347\240\226\345\267\245/letcode56.py"
@@ -0,0 +1,32 @@
+# Definition for an interval.
+# class Interval(object):
+#     def __init__(self, s=0, e=0):
+#         self.start = s
+#         self.end = e
+
+#该题主要是合并区间，先排序[l,r]队列，按照l升序，然后对l在其中的进行合并，不在其中的插入新的区间对继续操作。
+
+class Solution(object):
+    def merge(self, intervals):
+        """
+        :type intervals: List[Interval]
+        :rtype: List[Interval]
+        """
+        ans = []
+        lens = len(intervals)
+        if lens<=0:
+            return intervals
+        intervals = sorted(intervals,key = lambda v: v.start)
+        l = intervals[0].start
+        r = intervals[0].end
+        for p in range(lens):
+            pl = intervals[p].start
+            pr = intervals[p].end
+            if pl <= r:
+                r = max(r,pr)
+            else:
+                ans.append([l,r])
+                l = pl
+                r = pr
+        ans.append([l,r])
+        return ans
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/README.md" "b/\351\251\254\346\231\266\346\225\217/README.md"
new file mode 100644
index 0000000..0069f7c
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/README.md"
@@ -0,0 +1,19 @@
+
+
+# 马晶敏贡献榜
+
+
+
+## 1.[longest_common_prefix](https://github.com/guangcity/learning-algorithm/tree/master/%E9%A9%AC%E6%99%B6%E6%95%8F/longest_common_prefix)
+
+## 2.哈哈哈
+
+Hello，小伙伴你好！e
+我是curry_girl,马晶敏
+很高兴你能在茫茫人海中点开这篇readme
+如果你发现文件后缀是.txt,那这是我用C#语言
+如果你发现文件后缀是.py,就是python啦
+我应该走出舒适区多用python写的
+最后，希望这个能帮到你
+
+markdown语法！
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/longest_common_prefix/longest_common_prefix.txt" "b/\351\251\254\346\231\266\346\225\217/longest_common_prefix/longest_common_prefix.txt"
new file mode 100644
index 0000000..76c7ce4
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/longest_common_prefix/longest_common_prefix.txt"
@@ -0,0 +1,39 @@
+public class Solution {
+    public string LongestCommonPrefix(string[] strs) {
+        int n=strs.Length;
+        if(n==0)
+            return "";        
+        int minI=0;
+        int minL=int.MaxValue;
+        int currl=0;
+        for(int i=0;i<strs.Length;i++)
+        {
+            if(strs[i]==null || strs[i].Length<1)
+                return "";
+            currl=strs[i].Length;            
+            if(currl<minL)  
+            {
+                minL=currl;                           
+                minI=i;
+            }                
+        } 
+        int comL=0;
+        for(int i=0;i<minL;i++)
+        {
+            bool b=false;
+            for(int j=0;j<n;j++)
+            {
+                if(strs[j][i]!=strs[minI][i])
+                {
+                    b=true;
+                    break;      
+                }                                             
+            }
+            if(b)
+                break;
+            else
+                comL=i+1;
+        }
+        return strs[minI].Substring(0,comL);
+    }
+}
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/Manacher.txt" "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/Manacher.txt"
new file mode 100644
index 0000000..36a92eb
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/Manacher.txt"
@@ -0,0 +1,85 @@
+public class Solution {
+    public string LongestPalindrome(string s) {
+        int n = s.Length;
+            if (s == null || n < 1)
+                return "";
+            char[] sArr = s.ToArray();
+            string s1 = "#" + string.Join("#", sArr) + "#";
+            int m = s1.Length;
+            int maxR = 0;
+            int cenI = 0;
+            //int maxL = 0;
+            int cenIL = 0;
+            //int maxLength = 0;
+            List<int> len = new List<int>();
+            //计算Len[]数组
+            for (int i = 0; i < m; i++)
+            {
+                int r = 0;
+                if (i >= maxR)
+                {
+                    int j = 0;
+                    while (i - j >= 0 && i + j < m)
+                    {
+                        if (s1[i - j] == s1[i + j])
+                        {
+                            if (i + j >= maxR)
+                            {
+                                r = i + j;
+                            }
+                            j++;
+                        }
+                        else
+                            break;
+                    }
+                    if (r > maxR)
+                    {
+                        cenI = i;
+                        maxR = r;
+                    }
+                    len.Add(r - i + 1);
+                    if (r - i + 1 >= len.Max())
+                        cenIL = i;
+                }
+                else
+                {
+                    int iL = 2 * cenI - i;
+                    if (i <= maxR)
+                    {
+                        if (len[iL] < maxR - i)
+                             len.Add(len[iL]);
+                        else
+                        {
+                            int j = 0;
+                            while (i - j >= 0 && i + j < m)
+                            {
+                                if (s1[i - j] == s1[i + j])
+                                {
+                                    if (i + j >= maxR)
+                                    {
+                                        r = i + j;
+                                    }
+                                    j++;
+                                }
+                                else
+                                    break;
+                            }
+                            if (r > maxR)
+                            {
+                                cenI = i;
+                                maxR = r;
+                            }
+                            len.Add(r - i + 1);
+                            if (r - i + 1 >= len.Max())
+                                cenIL = i;
+                        }
+                    }
+                }
+            }
+            char[] sp= { '#' };
+            string subS1 = s1.Substring(cenIL-len[cenIL]+1,2*(len[cenIL]-1)+1);
+            string[] subS = subS1.Split(sp, StringSplitOptions.None);
+            string subSs=string.Join("", subS);
+            return subSs;
+    }
+}
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/central_expansion_algorithm.txt" "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/central_expansion_algorithm.txt"
new file mode 100644
index 0000000..f91861e
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/central_expansion_algorithm.txt"
@@ -0,0 +1,30 @@
+public class Solution {
+    public string LongestPalindrome(string s) {
+        if(s==null || s.Length<1)
+            return "";
+        int n=s.Length;
+        int start=0;
+        int end=0;
+        for(int i=0;i<n;i++)
+        {
+            int len1=expandAroundCenters(s,i,i);
+            int len2=expandAroundCenters(s,i,i+1);
+            int len= len1>len2?len1:len2;
+            if(len>end-start)
+            {
+                start=i-(len-1)/2;
+                end=i+ len /2;
+            }
+        }
+        return s.Substring(start,end-start+1);
+    }
+    public int expandAroundCenters(string s,int left,int right)
+    {
+        while(left>=0 && right<s.Length && s[left]==s[right])
+        {
+            left--;
+            right++;
+        }
+        return right-left-1;
+    }
+}
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/dynamic.py" "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/dynamic.py"
new file mode 100644
index 0000000..099d294
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/dynamic.py"
@@ -0,0 +1,32 @@
+class Solution:
+    def longestPalindrome(self, s):
+        """
+        :type s: str
+        :rtype: str
+        """
+        s_len=len(s)
+        if(s_len==0):
+            return s
+        maxL=1
+        startI=s_len-1
+        mat=[[0]* s_len for i in range(s_len)]
+        for i in range(s_len):
+            mat[i][i]=True            
+        for i in range(s_len-1):
+            if(s[i]==s[i+1]):
+                maxL=2
+                startI=i
+                mat[i][i+1]=True
+            else:
+                mat[i][i+1]=False
+        for i in range(2,s_len):
+            for j in range(0,s_len-i):
+                if(s[j]==s[j+i] and mat[j+1][j+i-1]):
+                    maxL=i+1
+                    startI=j
+                    mat[j][j+i]=True
+                else:
+                    mat[j][j+i]=False
+        return s[startI:startI+maxL]
+        
+            
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/dynamic.txt" "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/dynamic.txt"
new file mode 100644
index 0000000..cb078ba
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/dynamic.txt"
@@ -0,0 +1,46 @@
+public class Solution {
+    public string LongestPalindrome(string s) {
+        if (s == null || s.Length < 1)
+                return "";
+            int n = s.Length;
+            bool[,] mat = new bool[n, n];
+            string subS= null ;
+            int maxL = 1;
+            int startI = 0;
+            //初始化长度为1字符串
+            for (int i = 0; i < n; i++)
+            {
+                mat[i, i] = true;
+            }
+            //初始化长度为2字符串
+            for (int i = 0; i < n - 1; i++)
+            {
+                if (s[i] == s[i + 1])
+                {
+                    mat[i, i + 1] = true;
+                    maxL = 2;
+                    startI = i;
+                }
+                else
+                    mat[i, i + 1] = false;
+            }
+            //初始化长度为3及以上子符串
+            for (int i = 2; i < n; i++)
+            {
+                for (int j = 0; j < n - i; j++)
+                {
+                    if (s[j] == s[j + i] && mat[j + 1, j + i - 1])
+                    {
+                        mat[j, j + i] = true;
+                        maxL = i+1;
+                        startI = j;
+                    }
+                    else
+                        mat[j, j + i] = false;
+                }
+            }
+            subS = s.Substring(startI, maxL);
+            return subS;
+        
+    }
+}
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/violence_to_solve.txt" "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/violence_to_solve.txt"
new file mode 100644
index 0000000..d2b1d42
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/longest_palindromic_substring/violence_to_solve.txt"
@@ -0,0 +1,32 @@
+public class Solution {
+    public string LongestPalindrome(string s) {
+        if (s == null || s.Length <1)
+                return "";
+            char[] sArray = s.ToCharArray();
+            Array.Reverse(sArray);
+            string s1 =new string(sArray);
+            string currStr = s[0].ToString();
+            for (int i=s.Length;i>0;i--)
+            {                 
+                for(int j=0;j<s.Length+1-i;j++)
+                {
+                    currStr = s.Substring(j, i);
+                    if (s1.Contains(currStr))
+                    {
+                        bool b = true;
+                        for(int n=0;n<currStr.Length/2;n++)
+                        {
+                            if(currStr[n]!=currStr[currStr.Length-1-n])
+                            {
+                                b=false;   
+                                break;
+                            }
+                        }
+                        if(b)
+                            return currStr;    
+                    }
+                }
+            }
+            return currStr;   
+    }
+}
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/string_to_integer/string_to_integer.txt" "b/\351\251\254\346\231\266\346\225\217/string_to_integer/string_to_integer.txt"
new file mode 100644
index 0000000..a8b3b16
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/string_to_integer/string_to_integer.txt"
@@ -0,0 +1,51 @@
+public class Solution {
+    public int MyAtoi(string str) {        
+        str = str.Trim();
+        if (str == null || str.Length < 1)
+            return 0;
+        if (str.Length==1)
+        {
+            if(!char.IsNumber(str,0))
+                return 0;
+            else
+                return int.Parse(str.Substring(0,1));
+        }
+        else
+        {            
+            int numL = 1;
+            int result = 0;
+            if (str[0] == '-' || char.IsNumber(str, 0) || str[0]=='+')
+            {
+                for (int i = 1; i < str.Length; i++)
+                {
+                    if (char.IsNumber(str, i))
+                    {                        
+                        numL = i+1;
+                    }
+                    else
+                    {
+                        if (i == 1 && (str[0] == '-' ||str[0]=='+'))
+                            return 0;
+                        else if (i == 1 && char.IsNumber(str, 0))
+                            return int.Parse(str.Substring(0,1));
+                        else
+                            break;
+                    }
+
+                }
+                try
+                {
+                    result = int.Parse(str.Substring(0, numL));
+                }
+                catch
+                {
+                    if (str[0] == '-')
+                        result = int.MinValue;
+                    else
+                        result = int.MaxValue;
+                }
+            }    
+            return result;
+        }                
+    }
+}
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/sum_of_two/Violence_to_solve.txt" "b/\351\251\254\346\231\266\346\225\217/sum_of_two/Violence_to_solve.txt"
new file mode 100644
index 0000000..88782c1
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/sum_of_two/Violence_to_solve.txt"
@@ -0,0 +1,19 @@
+public class Solution {
+    public int[] TwoSum(int[] nums, int target) {
+        int[] result = new int[2]{0, 0};
+        for (int i = 0; i < nums.Length;i++)
+        {
+            int num = target - nums[i];
+            for (int j=i+1; j<nums.Length;j++)
+            {
+                if(nums[j]==num)
+                {
+                    result[0]=i;
+                    result[1]=j;
+                    break;
+                }
+            }
+        }
+        return result;
+    }
+}
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/sum_of_two/hash_to_solve.txt" "b/\351\251\254\346\231\266\346\225\217/sum_of_two/hash_to_solve.txt"
new file mode 100644
index 0000000..9a84f61
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/sum_of_two/hash_to_solve.txt"
@@ -0,0 +1,22 @@
+public class Solution 
+{
+    public int[] TwoSum(int[] nums, int target)
+    {
+        Dictionary<int,int> hash = new Dictionary<int,int>();
+            int[] result = new int[2];
+            for (int i = 0; i < nums.Length; i++)
+            {
+                int num = target - nums[i];
+                if (hash.ContainsKey(num))
+                {
+                    result=new int[] { hash[num], i};
+                    break;
+                }
+                else
+                {
+                    hash[nums[i]] = i;
+                }
+            }
+            return result;
+    }
+}
\ No newline at end of file
diff --git "a/\351\251\254\346\231\266\346\225\217/the_median_of_two_ordered_array/recursive_solution.txt" "b/\351\251\254\346\231\266\346\225\217/the_median_of_two_ordered_array/recursive_solution.txt"
new file mode 100644
index 0000000..7aafa09
--- /dev/null
+++ "b/\351\251\254\346\231\266\346\225\217/the_median_of_two_ordered_array/recursive_solution.txt"
@@ -0,0 +1,53 @@
+public class Solution {
+    public double FindMedianSortedArrays(int[] nums1, int[] nums2) {
+        int len1=nums1.Length;
+        int len2=nums2.Length;  
+        int maxLeft=0;
+        int minRight=0;
+        if(len1>len2)
+        {
+            int[] temp=nums1;
+            nums1=nums2;
+            nums2=temp;
+            int tem=len1;
+            len1=len2;
+            len2=tem;
+            //FindMedianSortedArrays(nums2,nums1);
+        }
+        int iMin=0;
+        int iMax=len1;
+        int halfLen=(len1+len2+1)/2;
+        while(iMin<=iMax)
+        {
+            int i = (iMin+iMax)/2;        
+            int j = halfLen-i;
+            if(i<iMax && nums2[j-1]>nums1[i])
+            {
+                iMin=i+1;                
+            }
+            else if(i>iMin && nums1[i-1]>nums2[j])
+            {
+                iMax=i-1;
+            }        
+            else
+            {
+                if(i==0)
+                    maxLeft=nums2[j-1];
+                else if(j==0)
+                    maxLeft=nums1[i-1];
+                else
+                    maxLeft=Math.Max(nums1[i-1],nums2[j-1]);
+                if((len1+len2)%2==1)
+                    return maxLeft;
+                if(i==len1)
+                    minRight=nums2[j];
+                else if(j==len2)
+                    minRight=nums1[i];
+                else
+                    minRight=Math.Min(nums1[i],nums2[j]);                            
+                return (maxLeft+minRight)/2.0;
+            }
+        }   
+        return -1;
+    }
+}
\ No newline at end of file