feat: add go solution to leetcode problem: No.0026

Author: yanglbme

solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md

@@ -105,6 +105,23 @@ var removeDuplicates = function (nums) {
 };
 ```
 
+### **Go**
+
+```go
+func removeDuplicates(nums []int) int {
+    cnt := 0
+    n := len(nums)
+    for i := 1; i < n; i++ {
+        if nums[i] == nums[i - 1] {
+            cnt++
+        } else {
+            nums[i - cnt] = nums[i]
+        }
+    }
+    return n - cnt
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md

@@ -115,6 +115,23 @@ var removeDuplicates = function (nums) {
 };
 ```
 
+### **Go**
+
+```go
+func removeDuplicates(nums []int) int {
+    cnt := 0
+    n := len(nums)
+    for i := 1; i < n; i++ {
+        if nums[i] == nums[i - 1] {
+            cnt++
+        } else {
+            nums[i - cnt] = nums[i]
+        }
+    }
+    return n - cnt
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0026.Remove Duplicates from Sorted Array/Solution.go

@@ -1,21 +1,12 @@
-/**
- * @lc app=leetcode.cn id=26 lang=golang
- * Accepted
- * 161/161 cases passed (144 ms)
- * Your runtime beats 36.91 % of golang submissions
- * Your memory usage beats 40.4 % of golang submissions (8.2 MB)
- */
-
 func removeDuplicates(nums []int) int {
-	if nums == nil || len(nums) == 0 {
-		return 0
-	}
-	j := 0
-	for i := 1; i < len(nums); i++ {
-		if nums[j] != nums[i] {
-			j++
-			nums[j] = nums[i]
-		}
-	}
-	return j + 1
-}
+    cnt := 0
+    n := len(nums)
+    for i := 1; i < n; i++ {
+        if nums[i] == nums[i - 1] {
+            cnt++
+        } else {
+            nums[i - cnt] = nums[i]
+        }
+    }
+    return n - cnt
+}