Update README.md

Author: zhangyu345293721

README.md

@@ -1,6 +1,6 @@
 # leetcode
-这个是我这段时间刷的leetcode题目，刚开始挺困难，后面刷多了，就有点节奏，做出来了有一种成就感！
-这些是我这点时间编写的源码，放到这里，以备以后能用到！<br>下面将整理出来这段时间刷的leetcode代码，和大家一起学习交流：
+这是我这段时间刷的leetcode题目，刚开始挺困难，后面刷多了，就有点节奏，做出来之后有一种成就感！
+我上传了的源码，放到github上，以后可能会用到！<br>下面将它整理出来，和大家一起学习交流：
 <table border="2" >
   <tr align="center" >
     <th width="300">题号</th>
@@ -107,12 +107,12 @@
     <th>中等</th>
   </tr>
    <tr>
-    <th >128</th>
+    <th .128</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/85006310">Longest Consecutive Sequence</a></th>
     <th>中等</th>
   </tr>
    <tr>
-    <th >215</th>
+    <th >.215</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84993730">Kth Largest Element in an Array</a></th>
     <th>中等</th>
   </tr>
@@ -142,7 +142,7 @@
     <th>中等</th>
   </tr>
     <tr>
-    <th >64</th>
+    <th >.64</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84979265">Jump Game</a></th>
     <th>中等</th>
   </tr>
@@ -165,7 +165,7 @@
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84976445">Edit Distance</a></th>
     <th>中等</th>
   </tr>  <tr>
-    <th >142</th>
+    <th >.142</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84961106">Linked List Cycle II</a></th>
     <th>中等</th>
   </tr>  <tr>
@@ -201,7 +201,7 @@
     <th>中等</th>
   </tr>
   <tr>
-    <th >5</th>
+    <th >.5</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84870880">Longest Palindromic Substring</a></th>
     <th>简单</th>
   </tr>
@@ -286,7 +286,7 @@
     <th >中等</th>
   </tr>
    <tr>
-    <th >198</th>
+    <th >.198</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84836482">House Robber</a></th>
     <th>简单</th>
   </tr>
@@ -372,7 +372,7 @@
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84310615">Top K Frequent Elements</a></th>
     <th>简单</th>
   </tr> <tr>
-    <th >606</th>
+    <th >.606</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84304381">Construct String from Binary Tree</a></th>
     <th>简单</th>
   </tr> <tr>
@@ -388,11 +388,11 @@
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/84031623">Linked List Cycle</a></th>
     <th>简单</th>
   </tr> <tr>
-    <th >268</th>
+    <th >.268</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83933311">Missing Number</a></th>
     <th>简单</th>
   </tr> <tr>
-    <th >521</th>
+    <th >.521</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/83744906">Longest Uncommon Subsequence I</a></th>
     <th>简单</th>
   </tr> <tr>
@@ -444,7 +444,7 @@
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/82585979">Sorted Question </a></th>
     <th>简单</th>
   </tr> <tr>
-    <th ></th>
+    <th >.</th>
     <th><a target="_blank" href="https://blog.csdn.net/zy345293721/article/details/82390156">Compute Digit</a></th>
     <th>简单</th>
   </tr>