feat: add golang solution to lc problems: No.54,154,189

Author: maolonglong

solution/0000-0099/0054.Spiral Matrix/README.md

@@ -145,6 +145,43 @@ var spiralOrder = function (matrix) {
 };
 ```
 
+### **Go**
+
+```go
+func spiralOrder(matrix [][]int) []int {
+	if len(matrix) == 0 {
+		return []int{}
+	}
+
+	m, n := len(matrix), len(matrix[0])
+	ans := make([]int, 0, m*n)
+
+	top, bottom, left, right := 0, m-1, 0, n-1
+	for left <= right && top <= bottom {
+		for i := left; i <= right; i++ {
+			ans = append(ans, matrix[top][i])
+		}
+		for i := top + 1; i <= bottom; i++ {
+			ans = append(ans, matrix[i][right])
+		}
+		if left < right && top < bottom {
+			for i := right - 1; i >= left; i-- {
+				ans = append(ans, matrix[bottom][i])
+			}
+			for i := bottom - 1; i > top; i-- {
+				ans = append(ans, matrix[i][left])
+			}
+		}
+		top++
+		bottom--
+		left++
+		right--
+	}
+
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0054.Spiral Matrix/README_EN.md

@@ -134,6 +134,43 @@ var spiralOrder = function (matrix) {
 };
 ```
 
+### **Go**
+
+```go
+func spiralOrder(matrix [][]int) []int {
+	if len(matrix) == 0 {
+		return []int{}
+	}
+
+	m, n := len(matrix), len(matrix[0])
+	ans := make([]int, 0, m*n)
+
+	top, bottom, left, right := 0, m-1, 0, n-1
+	for left <= right && top <= bottom {
+		for i := left; i <= right; i++ {
+			ans = append(ans, matrix[top][i])
+		}
+		for i := top + 1; i <= bottom; i++ {
+			ans = append(ans, matrix[i][right])
+		}
+		if left < right && top < bottom {
+			for i := right - 1; i >= left; i-- {
+				ans = append(ans, matrix[bottom][i])
+			}
+			for i := bottom - 1; i > top; i-- {
+				ans = append(ans, matrix[i][left])
+			}
+		}
+		top++
+		bottom--
+		left++
+		right--
+	}
+
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0054.Spiral Matrix/Solution.go

@@ -0,0 +1,32 @@
+func spiralOrder(matrix [][]int) []int {
+	if len(matrix) == 0 {
+		return []int{}
+	}
+
+	m, n := len(matrix), len(matrix[0])
+	ans := make([]int, 0, m*n)
+
+	top, bottom, left, right := 0, m-1, 0, n-1
+	for left <= right && top <= bottom {
+		for i := left; i <= right; i++ {
+			ans = append(ans, matrix[top][i])
+		}
+		for i := top + 1; i <= bottom; i++ {
+			ans = append(ans, matrix[i][right])
+		}
+		if left < right && top < bottom {
+			for i := right - 1; i >= left; i-- {
+				ans = append(ans, matrix[bottom][i])
+			}
+			for i := bottom - 1; i > top; i-- {
+				ans = append(ans, matrix[i][left])
+			}
+		}
+		top++
+		bottom--
+		left++
+		right--
+	}
+
+	return ans
+}

solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README.md

@@ -141,6 +141,28 @@ var findMin = function (nums) {
 };
 ```
 
+### **Go**
+
+```go
+func findMin(nums []int) int {
+	left, right := 0, len(nums)-1
+	for left+1 < right {
+		mid := int(uint(left+right) >> 1)
+		if nums[mid] > nums[right] {
+			left = mid
+		} else if nums[mid] < nums[right] {
+			right = mid
+		} else {
+			right--
+		}
+	}
+	if nums[left] < nums[right] {
+		return nums[left]
+	}
+	return nums[right]
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README_EN.md

@@ -112,6 +112,28 @@ var findMin = function (nums) {
 };
 ```
 
+### **Go**
+
+```go
+func findMin(nums []int) int {
+	left, right := 0, len(nums)-1
+	for left+1 < right {
+		mid := int(uint(left+right) >> 1)
+		if nums[mid] > nums[right] {
+			left = mid
+		} else if nums[mid] < nums[right] {
+			right = mid
+		} else {
+			right--
+		}
+	}
+	if nums[left] < nums[right] {
+		return nums[left]
+	}
+	return nums[right]
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/Solution.go

@@ -0,0 +1,17 @@
+func findMin(nums []int) int {
+	left, right := 0, len(nums)-1
+	for left+1 < right {
+		mid := int(uint(left+right) >> 1)
+		if nums[mid] > nums[right] {
+			left = mid
+		} else if nums[mid] < nums[right] {
+			right = mid
+		} else {
+			right--
+		}
+	}
+	if nums[left] < nums[right] {
+		return nums[left]
+	}
+	return nums[right]
+}

solution/0100-0199/0189.Rotate Array/README.md

@@ -35,7 +35,7 @@
 <pre>
 <strong>输入：</strong>nums = [-1,-100,3,99], k = 2
 <strong>输出：</strong>[3,99,-1,-100]
-<strong>解释:</strong> 
+<strong>解释:</strong>
 向右旋转 1 步: [99,-1,-100,3]
 向右旋转 2 步: [3,99,-1,-100]</pre>
 
@@ -136,6 +136,27 @@ var rotate = function (nums, k) {
 };
 ```
 
+### **Go**
+
+```go
+func rotate(nums []int, k int) {
+	n := len(nums)
+	k %= n
+
+	reverse(nums, 0, n-1)
+	reverse(nums, 0, k-1)
+	reverse(nums, k, n-1)
+}
+
+func reverse(nums []int, i, j int) {
+	for i < j {
+		nums[i], nums[j] = nums[j], nums[i]
+		i++
+		j--
+	}
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0189.Rotate Array/README_EN.md

@@ -23,7 +23,7 @@ rotate 3 steps to the right: [5,6,7,1,2,3,4]
 <pre>
 <strong>Input:</strong> nums = [-1,-100,3,99], k = 2
 <strong>Output:</strong> [3,99,-1,-100]
-<strong>Explanation:</strong> 
+<strong>Explanation:</strong>
 rotate 1 steps to the right: [99,-1,-100,3]
 rotate 2 steps to the right: [3,99,-1,-100]
 </pre>
@@ -112,6 +112,27 @@ var rotate = function (nums, k) {
 };
 ```
 
+### **Go**
+
+```go
+func rotate(nums []int, k int) {
+	n := len(nums)
+	k %= n
+
+	reverse(nums, 0, n-1)
+	reverse(nums, 0, k-1)
+	reverse(nums, k, n-1)
+}
+
+func reverse(nums []int, i, j int) {
+	for i < j {
+		nums[i], nums[j] = nums[j], nums[i]
+		i++
+		j--
+	}
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0189.Rotate Array/Solution.go

@@ -0,0 +1,16 @@
+func rotate(nums []int, k int) {
+	n := len(nums)
+	k %= n
+
+	reverse(nums, 0, n-1)
+	reverse(nums, 0, k-1)
+	reverse(nums, k, n-1)
+}
+
+func reverse(nums []int, i, j int) {
+	for i < j {
+		nums[i], nums[j] = nums[j], nums[i]
+		i++
+		j--
+	}
+}