From dde5eb3e1271375f013c2a6ed9e9117e910b5215 Mon Sep 17 00:00:00 2001
From: CyC2018 <1029579233@qq.com>
Date: Thu, 22 Feb 2018 16:34:39 +0800
Subject: [PATCH] auto commit

---
 notes/Leetcode 题解.md | 21 +++++++--------------
 1 file changed, 7 insertions(+), 14 deletions(-)

diff --git a/notes/Leetcode 题解.md b/notes/Leetcode 题解.md
index cd3f887b..73d7cfe5 100644
--- a/notes/Leetcode 题解.md	
+++ b/notes/Leetcode 题解.md	
@@ -389,7 +389,6 @@ public int[][] reconstructQueue(int[][] people) {
 }
 ```
 
-
 ## Ë«Ö¸Õë
 
 Ë«Ö¸ÕëÖ÷ÒªÓÃÓÚ±éÀúÊý×飬Á½¸öÖ¸ÕëÖ¸Ïò²»Í¬µÄÔªËØ£¬´Ó¶øЭͬÍê³ÉÈÎÎñ¡£
@@ -415,16 +414,6 @@ public int[] twoSum(int[] numbers, int target) {
 }
 ```
 
-´ËÎÊÌâ¿ÉÀ©Õ¹³ÉÈý¸öÔªËغÍΪ 0 µÄÎÊÌ⣺[³ÌÐòÔ±´úÂëÃæÊÔÖ¸ÄÏ P351](#)
-
-**Êý×éÖÐÀÛ¼ÓºÍΪ¸ø¶¨ÖµµÄ××ÓÊý×鳤¶È**
-
-[³ÌÐòÔ±´úÂëÃæÊÔÖ¸ÄÏ P354/P355/P358](#)
-
-**ÔÚÐкÍÁж¼ÅźÃÐòµÄ¾ØÕóÖвéÕÒÔªËØ**
-
-[³ÌÐòÔ±´úÂëÃæÊÔÖ¸ÄÏ P347](#)
-
 **·´×ª×Ö·û´®ÖеÄÔªÒô×Ö·û**
 
 [Leetcode : 345. Reverse Vowels of a String (Easy)](https://leetcode.com/problems/reverse-vowels-of-a-string/description/)
@@ -462,7 +451,7 @@ public String reverseVowels(String s) {
 
 [Leetcode : 633. Sum of Square Numbers (Easy)](https://leetcode.com/problems/sum-of-square-numbers/description/)
 
-ÅжÏÒ»¸öÊýÊÇ·ñΪÁ½¸öÊýµÄƽ·½ºÍ£¬ÀýÈç 5 = 1<sup>2</sup> + 2<sup>2</sup>¡£
+ÌâÄ¿ÃèÊö£ºÅжÏÒ»¸öÊýÊÇ·ñΪÁ½¸öÊýµÄƽ·½ºÍ£¬ÀýÈç 5 = 1<sup>2</sup> + 2<sup>2</sup>¡£
 
 ```java
 public boolean judgeSquareSum(int c) {
@@ -477,10 +466,12 @@ public boolean judgeSquareSum(int c) {
 }
 ```
 
-**×Ö·û´®»ØÎÄÊý£¨¿Éɾ³ýÒ»¸ö×Ö·û£©**
+**»ØÎÄ×Ö·û´®**
 
 [Leetcode : 680. Valid Palindrome II (Easy)](https://leetcode.com/problems/valid-palindrome-ii/description/)
 
+ÌâÄ¿ÃèÊö£º×Ö·û´®¿ÉÒÔɾ³ýÒ»¸ö×Ö·û£¬ÅжÏÊÇ·ñÄܹ¹³É»ØÎÄ×Ö·û´®¡£
+
 ```java
 public boolean validPalindrome(String s) {
     int i = 0, j = s.length() -1;
@@ -509,7 +500,7 @@ private boolean isPalindrome(String s, int l, int r){
 
 [Leetcode : 88. Merge Sorted Array (Easy)](https://leetcode.com/problems/merge-sorted-array/description/)
 
-°Ñ¹é²¢½á¹û´æµ½µÚÒ»¸öÊý×éÉÏ¡£
+ÌâÄ¿ÃèÊö£º°Ñ¹é²¢½á¹û´æµ½µÚÒ»¸öÊý×éÉÏ
 
 ```java
 public void merge(int[] nums1, int m, int[] nums2, int n) {
@@ -557,6 +548,8 @@ Output:
 "apple"
 ```
 
+ÌâÄ¿ÃèÊö£º¿ÉÒÔɾ³ý s ÖеÄһЩ×Ö·û£¬Ê¹µÃËü³ÉΪ×Ö·û´®Áбí d ÖеÄÒ»¸ö×Ö·û´®¡£ÒªÇóÔÚ d ÖÐÕÒµ½Âú×ãÌõ¼þµÄ××Ö·û´®¡£
+
 ```java
 public String findLongestWord(String s, List<String> d) {
     String ret = "";