feat: add golang solution to lc problems: No.3,8,14,238,345,383

Author: maolonglong

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -14,7 +14,7 @@
 
 <pre>
 <strong>输入: </strong>s = "abcabcbb"
-<strong>输出: </strong>3 
+<strong>输出: </strong>3
 <strong>解释:</strong> 因为无重复字符的最长子串是 <code>"abc"，所以其</code>长度为 3。
 </pre>
 
@@ -150,6 +150,35 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func lengthOfLongestSubstring(s string) int {
+	window := make(map[byte]int)
+	n := len(s)
+	ans := 0
+	left, right := 0, 0
+	for right < n {
+		b := s[right]
+		right++
+		window[b]++
+		for window[b] > 1 {
+			window[s[left]]--
+			left++
+		}
+		ans = max(ans, right-left)
+	}
+	return ans
+}
+
+func max(x, y int) int {
+	if x > y {
+		return x
+	}
+	return y
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

@@ -132,6 +132,35 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func lengthOfLongestSubstring(s string) int {
+	window := make(map[byte]int)
+	n := len(s)
+	ans := 0
+	left, right := 0, 0
+	for right < n {
+		b := s[right]
+		right++
+		window[b]++
+		for window[b] > 1 {
+			window[s[left]]--
+			left++
+		}
+		ans = max(ans, right-left)
+	}
+	return ans
+}
+
+func max(x, y int) int {
+	if x > y {
+		return x
+	}
+	return y
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.go

@@ -1,22 +1,24 @@
-/*
- * Report by leetcode.com
- * Runtime: 8 ms, Memory Usage: 3.2 MB
- */
 func lengthOfLongestSubstring(s string) int {
-	mathMax := func(a, b int) int {
-		if a > b {
-			return a
+	window := make(map[byte]int)
+	n := len(s)
+	ans := 0
+	left, right := 0, 0
+	for right < n {
+		b := s[right]
+		right++
+		window[b]++
+		for window[b] > 1 {
+			window[s[left]]--
+			left++
 		}
-		return b
+		ans = max(ans, right-left)
 	}
-	cache := map[rune]int{}
-	var max, position int
-	for i, r := range s {
-		if num, ok := cache[r]; ok {
-			position = mathMax(position, num+1)
-		}
-		cache[r] = i
-		max = mathMax(max, i-position+1)
+	return ans
+}
+
+func max(x, y int) int {
+	if x > y {
+		return x
 	}
-	return max
-}
+	return y
+}

solution/0000-0099/0008.String to Integer (atoi)/README.md

@@ -191,6 +191,46 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func myAtoi(s string) int {
+	i, n := 0, len(s)
+	num := 0
+
+	for i < n && s[i] == ' ' {
+		i++
+	}
+	if i == n {
+		return 0
+	}
+
+	sign := 1
+	if s[i] == '-' {
+		sign = -1
+		i++
+	} else if s[i] == '+' {
+		i++
+	}
+
+	for i < n && s[i] >= '0' && s[i] <= '9' {
+		num = num*10 + int(s[i]-'0')
+		i++
+		if num > math.MaxInt32 {
+			break
+		}
+	}
+
+	if num > math.MaxInt32 {
+		if sign == -1 {
+			return math.MinInt32
+		}
+		return math.MaxInt32
+	}
+	return sign * num
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0008.String to Integer (atoi)/README_EN.md

@@ -180,6 +180,46 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func myAtoi(s string) int {
+	i, n := 0, len(s)
+	num := 0
+
+	for i < n && s[i] == ' ' {
+		i++
+	}
+	if i == n {
+		return 0
+	}
+
+	sign := 1
+	if s[i] == '-' {
+		sign = -1
+		i++
+	} else if s[i] == '+' {
+		i++
+	}
+
+	for i < n && s[i] >= '0' && s[i] <= '9' {
+		num = num*10 + int(s[i]-'0')
+		i++
+		if num > math.MaxInt32 {
+			break
+		}
+	}
+
+	if num > math.MaxInt32 {
+		if sign == -1 {
+			return math.MinInt32
+		}
+		return math.MaxInt32
+	}
+	return sign * num
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0008.String to Integer (atoi)/Solution.go

@@ -1,37 +1,35 @@
-func myAtoi(str string) int {
-	cer := 0
-	result := 0
-    tmpResult := 0
-	flag := false
-	for _, n := range str {
-		if !flag && n == ' ' {
-			continue
-		}
-		flag = true
-		if cer == 0 {
-			if n >= '0' && n <= '9' {
-				cer = 1
-			} else if n == '+' {
-				cer = 1
-				continue
-			} else if cer == 0 && (n == '-') {
-				cer = -1
-				continue
-			}
-		}
+func myAtoi(s string) int {
+	i, n := 0, len(s)
+	num := 0
+
+	for i < n && s[i] == ' ' {
+		i++
+	}
+	if i == n {
+		return 0
+	}
 
-		if n >= '0' && n <= '9' {
-			tmpResult = tmpResult * 10 + ((int)(n) - 48)
-            result = cer * tmpResult
-		} else {
+	sign := 1
+	if s[i] == '-' {
+		sign = -1
+		i++
+	} else if s[i] == '+' {
+		i++
+	}
+
+	for i < n && s[i] >= '0' && s[i] <= '9' {
+		num = num*10 + int(s[i]-'0')
+		i++
+		if num > math.MaxInt32 {
 			break
 		}
-        if result < math.MinInt32 {
-		    return math.MinInt32
-        }
-        if result > math.MaxInt32 {
-            return math.MaxInt32
-        }
 	}
-	return result
-}
+
+	if num > math.MaxInt32 {
+		if sign == -1 {
+			return math.MinInt32
+		}
+		return math.MaxInt32
+	}
+	return sign * num
+}

solution/0000-0099/0014.Longest Common Prefix/README.md

@@ -101,6 +101,31 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func longestCommonPrefix(strs []string) string {
+	if len(strs) == 0 {
+		return ""
+	}
+
+	var b strings.Builder
+	m, n := len(strs[0]), len(strs)
+
+LOOP:
+	for i := 0; i < m; i++ {
+		for j := 1; j < n; j++ {
+			if i >= len(strs[j]) || strs[0][i] != strs[j][i] {
+				break LOOP
+			}
+		}
+		b.WriteByte(strs[0][i])
+	}
+
+	return b.String()
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0014.Longest Common Prefix/README_EN.md

@@ -92,6 +92,31 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func longestCommonPrefix(strs []string) string {
+	if len(strs) == 0 {
+		return ""
+	}
+
+	var b strings.Builder
+	m, n := len(strs[0]), len(strs)
+
+LOOP:
+	for i := 0; i < m; i++ {
+		for j := 1; j < n; j++ {
+			if i >= len(strs[j]) || strs[0][i] != strs[j][i] {
+				break LOOP
+			}
+		}
+		b.WriteByte(strs[0][i])
+	}
+
+	return b.String()
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0014.Longest Common Prefix/Solution.go

@@ -1,14 +1,20 @@
 func longestCommonPrefix(strs []string) string {
-	result := ""
-	for i, v := range strs {
-		if i == 0 {
-			result = v
-		}
-		index := 0
-		for index < len(result) && index < len(v) && result[index] == v[index] {
-			index++
+	if len(strs) == 0 {
+		return ""
+	}
+
+	var b strings.Builder
+	m, n := len(strs[0]), len(strs)
+
+LOOP:
+	for i := 0; i < m; i++ {
+		for j := 1; j < n; j++ {
+			if i >= len(strs[j]) || strs[0][i] != strs[j][i] {
+				break LOOP
+			}
 		}
-		result = result[:index]
+		b.WriteByte(strs[0][i])
 	}
-	return result
-}
+
+	return b.String()
+}