add 36. golang & update readme.md

Author: zj972

README.md

@@ -39,7 +39,7 @@
 |033|Search in Rotated Sorted Array|[Golang](https://github.com/zj972/leetcode/tree/master/code/033.%20Search%20in%20Rotated%20Sorted%20Array)|Medium|
 |034|Find First and Last Position of Element in Sorted Array|[Golang](https://github.com/zj972/leetcode/tree/master/code/034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array)|Medium|
 |035|Search Insert Position|[Golang](https://github.com/zj972/leetcode/tree/master/code/035.%20Search%20Insert%20Position)|Easy|
-|036|Valid Sudoku|[JavaScript](https://github.com/zj972/leetcode/tree/master/code/036.%20Valid%20Sudoku)|Easy|
+|036|Valid Sudoku|[JavaScript & Golang](https://github.com/zj972/leetcode/tree/master/code/036.%20Valid%20Sudoku)|Easy|
 |038|Count and Say|[JavaScript](https://github.com/zj972/leetcode/tree/master/code/038.%20Count%20and%20Say)|Easy|
 |058|Length of Last Word|[JavaScript](https://github.com/zj972/leetcode/tree/master/code/058.%20Length%20of%20Last%20Word)|Easy|
 |062|Unique Paths|[JavaScript](https://github.com/zj972/leetcode/tree/master/code/062.%20Unique%20Paths)|Medium|

code/002. Add Two Numbers/README.md

@@ -7,5 +7,7 @@ You may assume the two numbers do not contain any leading zero, except the numbe
 ##### Example:
 
 Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
+
 Output: 7 -> 0 -> 8
+
 Explanation: 342 + 465 = 807.

code/003. Longest Substring Without Repeating Characters/README.md

@@ -5,18 +5,25 @@ Given a string, find the length of the longest substring without repeating chara
 ##### Example 1:
 
 Input: "abcabcbb"
+
 Output: 3
+
 Explanation: The answer is "abc", with the length of 3.
 
 ##### Example 2:
 
 Input: "bbbbb"
+
 Output: 1
+
 Explanation: The answer is "b", with the length of 1.
 
 ##### Example 3:
 
 Input: "pwwkew"
+
 Output: 3
+
 Explanation: The answer is "wke", with the length of 3.
-             Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
+
+Note that the answer must be a substring, "pwke" is a subsequence and not a substring.

code/004. Median of Two Sorted Arrays/README.md

@@ -9,13 +9,15 @@ You may assume nums1 and nums2 cannot be both empty.
 ##### Example 1:
 
 nums1 = [1, 3]
+
 nums2 = [2]
 
 The median is 2.0
 
 ##### Example 2:
 
 nums1 = [1, 2]
+
 nums2 = [3, 4]
 
 The median is (2 + 3)/2 = 2.5

code/005. Longest Palindromic Substring/README.md

@@ -5,10 +5,13 @@ Given a string s, find the longest palindromic substring in s. You may assume th
 ##### Example 1:
 
 Input: "babad"
+
 Output: "bab"
+
 Note: "aba" is also a valid answer.
 
 ##### Example 2:
 
 Input: "cbbd"
+
 Output: "bb"

code/006. ZigZag Conversion/README.md

@@ -17,12 +17,15 @@ string convert(string s, int numRows);
 ##### Example 1:
 
 Input: s = "PAYPALISHIRING", numRows = 3
+
 Output: "PAHNAPLSIIGYIR"
 
 ##### Example 2:
 
 Input: s = "PAYPALISHIRING", numRows = 4
+
 Output: "PINALSIGYAHRPI"
+
 Explanation:
 
 ```text

code/007. Reverse Integer/README.md

@@ -5,16 +5,19 @@ Given a 32-bit signed integer, reverse digits of an integer.
 ##### Example 1:
 
 Input: 123
+
 Output: 321
 
 ##### Example 2:
 
 Input: -123
+
 Output: -321
 
 ##### Example 3:
 
 Input: 120
+
 Output: 21
 
 ##### Note:

code/008. String to Integer (atoi)/README.md

@@ -13,36 +13,48 @@ If no valid conversion could be performed, a zero value is returned.
 ##### Note:
 
 Only the space character ' ' is considered as whitespace character.
+
 Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−2<sup>31</sup>,  2<sup>31</sup> − 1]. If the numerical value is out of the range of representable values, INT_MAX (2<sup>31</sup> − 1) or INT_MIN (−2<sup>31</sup>) is returned.
 
 ##### Example 1:
 
 Input: "42"
+
 Output: 42
 
 ##### Example 2:
 
 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.
 
 ##### Example 3:
 
 Input: "4193 with words"
+
 Output: 4193
+
 Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.
 
 ##### Example 4:
 
 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"
+
 Output: -2147483648
+
 Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.
-             Thefore INT_MIN (−2<sup>31</sup>) is returned.
+
+Thefore INT_MIN (−2<sup>31</sup>) is returned.

code/009. Palindrome Number/README.md

@@ -5,19 +5,21 @@ Determine whether an integer is a palindrome. An integer is a palindrome when it
 ##### Example 1:
 
 Input: 121
+
 Output: true
 
 ##### Example 2:
 
 Input: -121
+
 Output: false
+
 Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
 
 ##### Example 3:
 
 Input: 10
+
 Output: false
-Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
-Follow up:
 
-Coud you solve it without converting the integer to a string?
+Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

code/010. Regular Expression Matching/README.md

@@ -9,42 +9,58 @@ 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 *.
 
 ##### Example 1:
 
 Input:
-s = "aa"
-p = "a"
+
+    s = "aa"
+    p = "a"
+
 Output: false
+
 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".
 
 ##### Example 3:
 
 Input:
-s = "ab"
-p = ".*"
+
+    s = "ab"
+    p = ".*"
+
 Output: true
+
 Explanation: ".*" means "zero or more (*) of any character (.)".
-Example 4:
+
+##### 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".
 
 ##### Example 5:
 
 Input:
-s = "mississippi"
-p = "mis*is*p*."
+
+    s = "mississippi"
+    p = "mis*is*p*."
+
 Output: false

code/011. Container With Most Water/README.md

@@ -13,4 +13,5 @@ The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this c
 ##### Example:
 
 Input: [1,8,6,2,5,4,8,3,7]
+
 Output: 49

code/012. Integer to Roman/README.md

@@ -28,26 +28,33 @@ Given an integer, convert it to a roman numeral. Input is guaranteed to be withi
 ##### Example 1:
 
 Input: 3
+
 Output: "III"
 
 ##### Example 2:
 
 Input: 4
+
 Output: "IV"
 
 ##### Example 3:
 
 Input: 9
+
 Output: "IX"
 
 ##### Example 4:
 
 Input: 58
+
 Output: "LVIII"
+
 Explanation: C = 100, L = 50, XXX = 30 and III = 3.
 
 ##### Example 5:
 
 Input: 1994
+
 Output: "MCMXCIV"
+
 Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

code/013. Roman to Integer/README.md

@@ -29,26 +29,33 @@ Given a roman numeral, convert it to an integer. Input is guaranteed to be withi
 ##### Example 1:
 
 Input: "III"
+
 Output: 3
 
 ##### Example 2:
 
 Input: "IV"
+
 Output: 4
 
 ##### Example 3:
 
 Input: "IX"
+
 Output: 9
 
 ##### Example 4:
 
 Input: "LVIII"
+
 Output: 58
+
 Explanation: L = 50, V= 5, III = 3.
 
 ##### Example 5:
 
 Input: "MCMXCIV"
+
 Output: 1994
+
 Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

code/014. Longest Common Prefix/README.md

@@ -7,12 +7,15 @@ If there is no common prefix, return an empty string "".
 ##### Example 1:
 
 Input: ["flower","flow","flight"]
+
 Output: "fl"
 
 ##### Example 2:
 
 Input: ["dog","racecar","car"]
+
 Output: ""
+
 Explanation: There is no common prefix among the input strings.
 
 ##### Note:

code/015. 3Sum/README.md

@@ -11,7 +11,10 @@ The solution set must not contain duplicate triplets.
 Given array nums = [-1, 0, 1, 2, -1, -4],
 
 A solution set is:
+
+```text
 [
   [-1, 0, 1],
   [-1, -1, 2]
-]
+]
+```

code/018. 4Sum/README.md

@@ -11,8 +11,11 @@ The solution set must not contain duplicate quadruplets.
 Given array nums = [1, 0, -1, 0, -2, 2], and target = 0.
 
 A solution set is:
+
+```text
 [
   [-1,  0, 0, 1],
   [-2, -1, 1, 2],
   [-2,  0, 0, 2]
-]
+]
+```