feat: add golang solution to lc problem: No.2208 (#775)

No.2208.Minimum Operations to Halve Array Sum

Author: youzeliang

solution/2200-2299/2208.Minimum Operations to Halve Array Sum/README.md

@@ -79,9 +79,30 @@ nums 的和减小了 31 - 14.5 = 16.5 ，减小的部分超过了初始数组和
 
 ```
 
-### **...**
-
-```
+### **Go**
+
+```go
+func halveArray(nums []int) (ans int) {
+    half := 0
+    for i := range nums {
+        nums[i] <<= 20
+        half += nums[i]
+    }
+    h := hp{nums}
+    heap.Init(&h)
+    for half >>= 1; half > 0; ans++ {
+        half -= h.IntSlice[0] >> 1
+        h.IntSlice[0] >>= 1
+        heap.Fix(&h, 0)
+    }
+    return
+}
+
+type hp struct{ sort.IntSlice }
+
+func (h hp) Less(i, j int) bool { return h.IntSlice[i] > h.IntSlice[j] }
+func (hp) Push(interface{})     {}
+func (hp) Pop() (_ interface{}) { return }
 
 ```
 

solution/2200-2299/2208.Minimum Operations to Halve Array Sum/README_EN.md

@@ -71,9 +71,30 @@ It can be shown that we cannot reduce the sum by at least half in less than 3 op
 
 ```
 
-### **...**
-
-```
+### **Go**
+
+```go
+func halveArray(nums []int) (ans int) {
+    half := 0
+    for i := range nums {
+        nums[i] <<= 20
+        half += nums[i]
+    }
+    h := hp{nums}
+    heap.Init(&h)
+    for half >>= 1; half > 0; ans++ {
+        half -= h.IntSlice[0] >> 1
+        h.IntSlice[0] >>= 1
+        heap.Fix(&h, 0)
+    }
+    return
+}
+
+type hp struct{ sort.IntSlice }
+
+func (h hp) Less(i, j int) bool { return h.IntSlice[i] > h.IntSlice[j] }
+func (hp) Push(interface{})     {}
+func (hp) Pop() (_ interface{}) { return }
 
 ```
 

solution/2200-2299/2208.Minimum Operations to Halve Array Sum/Solution.go

@@ -0,0 +1,21 @@
+func halveArray(nums []int) (ans int) {
+	half := 0
+	for i := range nums {
+		nums[i] <<= 20
+		half += nums[i]
+	}
+	h := hp{nums}
+	heap.Init(&h)
+	for half >>= 1; half > 0; ans++ {
+		half -= h.IntSlice[0] >> 1
+		h.IntSlice[0] >>= 1
+		heap.Fix(&h, 0)
+	}
+	return
+}
+
+type hp struct{ sort.IntSlice }
+
+func (h hp) Less(i, j int) bool { return h.IntSlice[i] > h.IntSlice[j] }
+func (hp) Push(interface{})     {}
+func (hp) Pop() (_ interface{}) { return }