fix: fix some

Blankj · Dec 13, 2017 · d54abce · d54abce
1 parent 05de575
commit d54abce
Show file tree

Hide file tree

Showing 3 changed files with 12 additions and 10 deletions.
diff --git a/note/006/README.md b/note/006/README.md
@@ -1,4 +1,4 @@
-# [Longest Palindromic Substring][title]
+# [ZigZag Conversion][title]
 
 ## Description
 
@@ -106,5 +106,5 @@ class Solution {
 
 
 
-[title]: https://leetcode.com/problems/longest-palindromic-substring
+[title]: https://leetcode.com/problems/zigzag-conversion
 [ajl]: https://github.com/Blankj/awesome-java-leetcode
diff --git a/note/009/README.md b/note/009/README.md
@@ -42,14 +42,16 @@ class Solution {
 好好思考下是否需要计算整个长度，比如 1234321，其实不然，我们只需要计算一半的长度即可，就是在计算过程中的那个逆序数比不断除 10 的数大就结束计算即可，但是这也带来了另一个问题，比如 10 的倍数的数 10010，它也会返回 `true`，所以我们需要对 10 的倍数的数再加个判断即可，代码如下所示。
 
 ```java
-public boolean isPalindrome(int x) {
-    if (x < 0 || (x != 0 && x % 10 == 0)) return false;
-    int halfReverseX = 0;
-    while (x > halfReverseX) {
-        halfReverseX = halfReverseX * 10 + x % 10;
-        x /= 10;
+class Solution {
+    public boolean isPalindrome(int x) {
+        if (x < 0 || (x != 0 && x % 10 == 0)) return false;
+        int halfReverseX = 0;
+        while (x > halfReverseX) {
+            halfReverseX = halfReverseX * 10 + x % 10;
+            x /= 10;
+        }
+        return halfReverseX == x || halfReverseX / 10 == x;
     }
-    return halfReverseX == x || halfReverseX / 10 == x;
 }
 ```
 

diff --git a/note/069/README.md b/note/069/README.md
@@ -28,7 +28,7 @@ Explanation: The square root of 8 is 2.82842..., and since we want to return an
 
 ## 思路
 
-题意是求平方根，参考[牛顿迭代法求平方根](https://wenku.baidu.com/view/6b74c622bcd126fff7050bfe.html)，然后再参考维基百科的[Integer square root](https://en.wikipedia.org/wiki/Integer_square_root#Using_only_integer_division)即可。
+题意是求平方根，参考 [牛顿迭代法求平方根](https://wenku.baidu.com/view/6b74c622bcd126fff7050bfe.html)，然后再参考维基百科的 [Integer square root](https://en.wikipedia.org/wiki/Integer_square_root#Using_only_integer_division) 即可。
 
 ```java
 class Solution {