readme

Author: Chris Wu

3sum.py

@@ -2,25 +2,27 @@ class Solution(object):
 	#this is the answer from caikehe and all the comments below
 
 	"""
-	the main idea is to iterate every number in nums.
-	we use the number as a target to find two other numbers which make total zero.
-	for those two other numbers, we move pointers, l and r, to try them.
+	This is the answer from caikehe and all the comments below
+
+	The main idea is to iterate every number in nums.
+	We use the number as a target to find two other numbers which make total zero.
+	For those two other numbers, we move pointers, l and r, to try them.
 
 	l start from left to right
 	r start from right to left
-	
-	first, we sort the array, so we can easily move i around and know how to adjust l and r.
-	if the number is the same as the number before, we have used it as target already, continue. [1]
-	we always start the left pointer from i+1 because the combination has already tried. [2]
 
-	now we calculate the total
-	if the total is less than zero, we need it to be larger, so we move the left pointer. [3]
-	if the total is greater than zero, we need it to be smaller, so we move the right pointer. [4]
-	if the total is zero, bingo! [5]
-	we need to move the left and right pointers to the next different numbers, so we do not get repeating result. [6]
+	First, we sort the array, so we can easily move i around and know how to adjust l and r.
+	If the number is the same as the number before, we have used it as target already, continue. [1]
+	We always start the left pointer from i+1 because the combination of 0~i has already been tried. [2]
+
+	Now we calculate the total:
+	If the total is less than zero, we need it to be larger, so we move the left pointer. [3]
+	If the total is greater than zero, we need it to be smaller, so we move the right pointer. [4]
+	If the total is zero, bingo! [5]
+	We need to move the left and right pointers to the next different numbers, so we do not get repeating result. [6]
 
-	we do not need to consider i after nums[i]>0, since sum of positive will be always greater than zero. [7]
-	we do not need to try the last two, since there are no rooms for l and r pointers.
+	We do not need to consider i after nums[i]>0, since sum of 3 positive will be always greater than zero. [7]
+	We do not need to try the last two, since there are no rooms for l and r pointers.
 	You can think of it as The last two have been tried by all others. [8]
 	"""
 
@@ -50,12 +52,6 @@ def threeSum(self, nums):
 					r-=1
 		return res
 
-"""
-I really take time to make the best solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-
-"""
-
 	"""
     def threeSum(self, nums):
         def twoSum(target, nums):

README.md

@@ -0,0 +1,9 @@
+#Leetcode Python Solution
+1. This is my Python Solution on leetcode `@christopherwu0529`.
+
+2. The question is at `<https://leetcode.com/problems/the-file-name/>`.
+
+	For example, `merge-sorted-array.py`'s question is at <https://leetcode.com/problems/merge-sorted-array/>.
+
+
+3. I really take time tried to make the best solution or explaination, because I wanted to help others like me. If you like my answer, a star on GitHub means a lot to me. <https://github.com/wuduhren/leetcode-python>.

add-binary.py

@@ -1,10 +1,4 @@
 #https://leetcode.com/problems/add-binary/
 class Solution(object):
     def addBinary(self, a, b):
-        return bin(int(a, 2)+int(b, 2))[2:]
-
-"""
-I really take time to make the best solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-python
-"""
+        return bin(int(a, 2)+int(b, 2))[2:]

best-time-to-buy-an-stock.py

@@ -11,10 +11,4 @@ def maxProfit(self, prices):
                 minPrice = price
             if (price-minPrice>maxProfit):
                 maxProfit = price-minPrice
-        return maxProfit
-
-"""
-I really take time to make the best solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-python
-"""
+        return maxProfit

binary-search-tree-iterator.py

@@ -33,10 +33,4 @@ def hasNext(self):
 # Your BSTIterator object will be instantiated and called as such:
 # obj = BSTIterator(root)
 # param_1 = obj.next()
-# param_2 = obj.hasNext()
-
-"""
-I really take time to make the best solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-python
-"""
+# param_2 = obj.hasNext()

first-unique-character-in-a-string.py

@@ -14,10 +14,4 @@ def firstUniqChar(self, string):
             if counter[char]==1:
                 return i
 
-        return -1
-
-"""
-I really take time to make the best solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-python
-"""
+        return -1

group-anagrams.py

@@ -11,10 +11,4 @@ def groupAnagrams(self, strs):
 
             dic[tuple(string_count)].append(string)
 
-        return dic.values()
-
-"""
-I really take time to make the best solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-
-"""
+        return dic.values()

linked-list-cycle.py

@@ -8,10 +8,4 @@ def hasCycle(self, head):
             slow = slow.next
             if (fast==slow):
                 return True
-        return False
-
-"""
-I really take time to make the best solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-python
-"""
+        return False

longest-common-prefix.py

@@ -14,10 +14,4 @@ def longestCommonPrefix(self, strs):
                         return ''
                     else:
                         return bench_mark[:i-1]
-        return bench_mark
-
-"""
-I really take time to make the best solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-python
-"""
+        return bench_mark

longest-palindromic-substring.py

@@ -41,9 +41,4 @@ def findPalindorome(mid, mid2=None):
             max_pal = p2 if len(p2)>len(max_pal) else max_pal
 
         return max_pal
-"""
-I really take time to explain my solution, because I wanted to help people understand.
-If you like my answer, a star on GitHub I will really appreciated.
-https://github.com/wuduhren/leetcode-python
-"""