feat: add golang solution to lc problem: No.1705

No.1705.Maximum Number of Eaten Apples

Author: maolonglong

Diff for: solution/1700-1799/1705.Maximum Number of Eaten Apples/README.md

@@ -139,6 +139,44 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func eatenApples(apples []int, days []int) int {
+	var h hp
+	ans, n := 0, len(apples)
+	for i := 0; i < n || len(h) > 0; i++ {
+		if i < n && apples[i] > 0 {
+			heap.Push(&h, pair{i + days[i] - 1, apples[i]})
+		}
+		for len(h) > 0 && h[0].first < i {
+			heap.Pop(&h)
+		}
+		if len(h) > 0 {
+			h[0].second--
+			if h[0].first == i || h[0].second == 0 {
+				heap.Pop(&h)
+			}
+			ans++
+		}
+	}
+	return ans
+}
+
+type pair struct {
+	first  int
+	second int
+}
+
+type hp []pair
+
+func (a hp) Len() int            { return len(a) }
+func (a hp) Swap(i, j int)       { a[i], a[j] = a[j], a[i] }
+func (a hp) Less(i, j int) bool  { return a[i].first < a[j].first }
+func (a *hp) Push(x interface{}) { *a = append(*a, x.(pair)) }
+func (a *hp) Pop() interface{}   { l := len(*a); t := (*a)[l-1]; *a = (*a)[:l-1]; return t }
+```
+
 ### **...**
 
 ```

Diff for: solution/1700-1799/1705.Maximum Number of Eaten Apples/README_EN.md

@@ -129,6 +129,44 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func eatenApples(apples []int, days []int) int {
+	var h hp
+	ans, n := 0, len(apples)
+	for i := 0; i < n || len(h) > 0; i++ {
+		if i < n && apples[i] > 0 {
+			heap.Push(&h, pair{i + days[i] - 1, apples[i]})
+		}
+		for len(h) > 0 && h[0].first < i {
+			heap.Pop(&h)
+		}
+		if len(h) > 0 {
+			h[0].second--
+			if h[0].first == i || h[0].second == 0 {
+				heap.Pop(&h)
+			}
+			ans++
+		}
+	}
+	return ans
+}
+
+type pair struct {
+	first  int
+	second int
+}
+
+type hp []pair
+
+func (a hp) Len() int            { return len(a) }
+func (a hp) Swap(i, j int)       { a[i], a[j] = a[j], a[i] }
+func (a hp) Less(i, j int) bool  { return a[i].first < a[j].first }
+func (a *hp) Push(x interface{}) { *a = append(*a, x.(pair)) }
+func (a *hp) Pop() interface{}   { l := len(*a); t := (*a)[l-1]; *a = (*a)[:l-1]; return t }
+```
+
 ### **...**
 
 ```

Diff for: solution/1700-1799/1705.Maximum Number of Eaten Apples/Solution.go

@@ -0,0 +1,33 @@
+func eatenApples(apples []int, days []int) int {
+	var h hp
+	ans, n := 0, len(apples)
+	for i := 0; i < n || len(h) > 0; i++ {
+		if i < n && apples[i] > 0 {
+			heap.Push(&h, pair{i + days[i] - 1, apples[i]})
+		}
+		for len(h) > 0 && h[0].first < i {
+			heap.Pop(&h)
+		}
+		if len(h) > 0 {
+			h[0].second--
+			if h[0].first == i || h[0].second == 0 {
+				heap.Pop(&h)
+			}
+			ans++
+		}
+	}
+	return ans
+}
+
+type pair struct {
+	first  int
+	second int
+}
+
+type hp []pair
+
+func (a hp) Len() int            { return len(a) }
+func (a hp) Swap(i, j int)       { a[i], a[j] = a[j], a[i] }
+func (a hp) Less(i, j int) bool  { return a[i].first < a[j].first }
+func (a *hp) Push(x interface{}) { *a = append(*a, x.(pair)) }
+func (a *hp) Pop() interface{}   { l := len(*a); t := (*a)[l-1]; *a = (*a)[:l-1]; return t }