update at 2018-04-20

Author: bonfy

001-two-sum/two-sum.js

@@ -11,7 +11,7 @@
 // return [0, 1].
 //
 //
-//  
+//  
 //
 
 

001-two-sum/two-sum.py

@@ -14,7 +14,7 @@
 # return [0, 1].
 #
 #
-#  
+#  
 #
 
 

005-longest-palindromic-substring/longest-palindromic-substring.py

@@ -6,16 +6,16 @@
 # Example 1:
 #
 #
-# Input: "babad"
-# Output: "bab"
-# Note: "aba" is also a valid answer.
+# Input: "babad"
+# Output: "bab"
+# Note: "aba" is also a valid answer.
 #
 #
 # Example 2:
 #
 #
-# Input: "cbbd"
-# Output: "bb"
+# Input: "cbbd"
+# Output: "bb"
 #
 #
 

006-zigzag-conversion/zigzag-conversion.py

@@ -1,15 +1,15 @@
 # -*- coding:utf-8 -*-
 
 
-# The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
+# The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
 #
 #
 # P   A   H   N
 # A P L S I I G
 # Y   I   R
 #
 #
-# And then read line by line: "PAHNAPLSIIGYIR"
+# And then read line by line: "PAHNAPLSIIGYIR"
 #
 # Write the code that will take a string and make this conversion given a number of rows:
 #
@@ -19,15 +19,15 @@
 # Example 1:
 #
 #
-# Input: s = "PAYPALISHIRING", numRows = 3
-# Output: "PAHNAPLSIIGYIR"
+# Input: s = "PAYPALISHIRING", numRows = 3
+# Output: "PAHNAPLSIIGYIR"
 #
 #
 # Example 2:
 #
 #
-# Input: s = "PAYPALISHIRING", numRows = 4
-# Output: "PINALSIGYAHRPI"
+# Input: s = "PAYPALISHIRING", numRows = 4
+# Output: "PINALSIGYAHRPI"
 # Explanation:
 #
 # P     I    N

007-reverse-integer/reverse-integer.py

@@ -25,7 +25,7 @@
 #
 #
 # Note:
-# Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
+# Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
 #
 
 

008-string-to-integer-atoi/string-to-integer-atoi.py

@@ -1,7 +1,7 @@
 # -*- coding:utf-8 -*-
 
 
-# Implement atoi which converts a string to an integer.
+# Implement atoi which converts a string to an integer.
 #
 # The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value.
 #
@@ -12,47 +12,47 @@
 # If no valid conversion could be performed, a zero value is returned.
 #
 # Note:
-# Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.
+# Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.
 #
 # Example 1:
 #
 #
-# Input: "42"
+# Input: "42"
 # Output: 42
 #
 #
 # Example 2:
 #
 #
-# Input: "   -42"
+# Input: "   -42"
 # Output: -42
-# Explanation: The first non-whitespace character is '-', which is the minus sign.
-#              Then take as many numerical digits as possible, which gets 42.
+# Explanation: The first non-whitespace character is '-', which is the minus sign.
+#              Then take as many numerical digits as possible, which gets 42.
 #
 #
 # Example 3:
 #
 #
-# Input: "4193 with words"
+# Input: "4193 with words"
 # Output: 4193
-# Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.
+# Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.
 #
 #
 # Example 4:
 #
 #
-# Input: "words and 987"
+# Input: "words and 987"
 # Output: 0
-# Explanation: The first non-whitespace character is 'w', which is not a numerical 
-#              digit or a +/- sign. Therefore no valid conversion could be performed.
+# Explanation: The first non-whitespace character is 'w', which is not a numerical 
+#              digit or a +/- sign. Therefore no valid conversion could be performed.
 #
 # Example 5:
 #
 #
-# Input: "-91283472332"
+# Input: "-91283472332"
 # Output: -2147483648
-# Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.
-#              Thefore INT_MIN (−231) is returned.
+# Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.
+#              Thefore INT_MIN (−231) is returned.
 #
 
 

009-palindrome-number/palindrome-number.py

@@ -1,7 +1,7 @@
 # -*- coding:utf-8 -*-
 
 
-# Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
+# Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
 #
 # Example 1:
 #
@@ -28,7 +28,7 @@
 #
 # Follow up:
 #
-# Coud you solve it without converting the integer to a string?
+# Coud you solve it without converting the integer to a string?
 #
 
 

010-regular-expression-matching/regular-expression-matching.py

@@ -1,68 +1,68 @@
 # -*- coding:utf-8 -*-
 
 
-# Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.
+# Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.
 #
 #
-# '.' Matches any single character.
-# '*' Matches zero or more of the preceding element.
+# '.' Matches any single character.
+# '*' Matches zero or more of the preceding element.
 #
 #
 # The matching should cover the entire input string (not partial).
 #
 # Note:
 #
 #
-# 	s could be empty and contains only lowercase letters a-z.
-# 	p could be empty and contains only lowercase letters a-z, and characters like . or *.
+# 	s could be empty and contains only lowercase letters a-z.
+# 	p could be empty and contains only lowercase letters a-z, and characters like . or *.
 #
 #
 # Example 1:
 #
 #
 # Input:
-# s = "aa"
-# p = "a"
+# s = "aa"
+# p = "a"
 # Output: false
-# Explanation: "a" does not match the entire string "aa".
+# Explanation: "a" does not match the entire string "aa".
 #
 #
 # Example 2:
 #
 #
 # Input:
-# s = "aa"
-# p = "a*"
+# s = "aa"
+# p = "a*"
 # Output: true
-# Explanation: '*' means zero or more of the precedeng element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".
+# Explanation: '*' means zero or more of the precedeng element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".
 #
 #
 # Example 3:
 #
 #
 # Input:
-# s = "ab"
-# p = ".*"
+# s = "ab"
+# p = ".*"
 # Output: true
-# Explanation: ".*" means "zero or more (*) of any character (.)".
+# Explanation: ".*" means "zero or more (*) of any character (.)".
 #
 #
 # Example 4:
 #
 #
 # Input:
-# s = "aab"
-# p = "c*a*b"
+# s = "aab"
+# p = "c*a*b"
 # Output: true
-# Explanation: c can be repeated 0 times, a can be repeated 1 time. Therefore it matches "aab".
+# Explanation: c can be repeated 0 times, a can be repeated 1 time. Therefore it matches "aab".
 #
 #
 # Example 5:
 #
 #
 # Input:
-# s = "mississippi"
-# p = "mis*is*p*."
+# s = "mississippi"
+# p = "mis*is*p*."
 # Output: false
 #
 #

012-integer-to-roman/integer-to-roman.py

@@ -1,7 +1,7 @@
 # -*- coding:utf-8 -*-
 
 
-# Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
+# Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
 #
 #
 # Symbol       Value
@@ -13,13 +13,13 @@
 # D             500
 # M             1000
 #
-# For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.
+# For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.
 #
 # Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:
 #
 #
-# 	I can be placed before V (5) and X (10) to make 4 and 9. 
-# 	X can be placed before L (50) and C (100) to make 40 and 90. 
+# 	I can be placed before V (5) and X (10) to make 4 and 9. 
+# 	X can be placed before L (50) and C (100) to make 40 and 90. 
 # 	C can be placed before D (500) and M (1000) to make 400 and 900.
 #
 #
@@ -28,34 +28,34 @@
 # Example 1:
 #
 #
-# Input: 3
-# Output: "III"
+# Input: 3
+# Output: "III"
 #
 # Example 2:
 #
 #
-# Input: 4
-# Output: "IV"
+# Input: 4
+# Output: "IV"
 #
 # Example 3:
 #
 #
-# Input: 9
-# Output: "IX"
+# Input: 9
+# Output: "IX"
 #
 # Example 4:
 #
 #
-# Input: 58
-# Output: "LVIII"
+# Input: 58
+# Output: "LVIII"
 # Explanation: C = 100, L = 50, XXX = 30 and III = 3.
 #
 #
 # Example 5:
 #
 #
-# Input: 1994
-# Output: "MCMXCIV"
+# Input: 1994
+# Output: "MCMXCIV"
 # Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
 #
 

013-roman-to-integer/roman-to-integer.py

@@ -1,7 +1,7 @@
 # -*- coding:utf-8 -*-
 
 
-# Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
+# Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
 #
 #
 # Symbol       Value
@@ -13,13 +13,13 @@
 # D             500
 # M             1000
 #
-# For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.
+# For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.
 #
 # Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:
 #
 #
-# 	I can be placed before V (5) and X (10) to make 4 and 9. 
-# 	X can be placed before L (50) and C (100) to make 40 and 90. 
+# 	I can be placed before V (5) and X (10) to make 4 and 9. 
+# 	X can be placed before L (50) and C (100) to make 40 and 90. 
 # 	C can be placed before D (500) and M (1000) to make 400 and 900.
 #
 #
@@ -28,33 +28,33 @@
 # Example 1:
 #
 #
-# Input: "III"
+# Input: "III"
 # Output: 3
 #
 # Example 2:
 #
 #
-# Input: "IV"
+# Input: "IV"
 # Output: 4
 #
 # Example 3:
 #
 #
-# Input: "IX"
+# Input: "IX"
 # Output: 9
 #
 # Example 4:
 #
 #
-# Input: "LVIII"
+# Input: "LVIII"
 # Output: 58
 # Explanation: C = 100, L = 50, XXX = 30 and III = 3.
 #
 #
 # Example 5:
 #
 #
-# Input: "MCMXCIV"
+# Input: "MCMXCIV"
 # Output: 1994
 # Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
 #