Update README_EN.md

Author: yanglbme

solution/0200-0299/0281.Zigzag Iterator/README_EN.md

@@ -163,6 +163,54 @@ public class ZigzagIterator {
  */
 ```
 
+#### Go
+
+```go
+type ZigzagIterator struct {
+	cur     int
+	size    int
+	indexes []int
+	vectors [][]int
+}
+
+func Constructor(v1, v2 []int) *ZigzagIterator {
+	return &ZigzagIterator{
+		cur:     0,
+		size:    2,
+		indexes: []int{0, 0},
+		vectors: [][]int{v1, v2},
+	}
+}
+
+func (this *ZigzagIterator) next() int {
+	vector := this.vectors[this.cur]
+	index := this.indexes[this.cur]
+	res := vector[index]
+	this.indexes[this.cur]++
+	this.cur = (this.cur + 1) % this.size
+	return res
+}
+
+func (this *ZigzagIterator) hasNext() bool {
+	start := this.cur
+	for this.indexes[this.cur] == len(this.vectors[this.cur]) {
+		this.cur = (this.cur + 1) % this.size
+		if start == this.cur {
+			return false
+		}
+	}
+	return true
+}
+
+/**
+ * Your ZigzagIterator object will be instantiated and called as such:
+ * obj := Constructor(param_1, param_2);
+ * for obj.hasNext() {
+ *	 ans = append(ans, obj.next())
+ * }
+ */
+```
+
 #### Rust
 
 ```rust
@@ -221,46 +269,6 @@ impl ZigzagIterator {
 }
 ```
 
-#### Go
-
-```go
-type ZigzagIterator struct {
-	cur     int
-	size    int
-	indexes []int
-	vectors [][]int
-}
-
-func Constructor(v1 []int, v2 []int) *ZigzagIterator {
-	return &ZigzagIterator{
-		cur:     0,
-		size:    2,
-		indexes: []int{0, 0},
-		vectors: [][]int{v1, v2},
-	}
-}
-
-func (this *ZigzagIterator) Next() int {
-	vector := this.vectors[this.cur]
-	index := this.indexes[this.cur]
-	res := vector[index]
-	this.indexes[this.cur]++
-	this.cur = (this.cur + 1) % this.size
-	return res
-}
-
-func (this *ZigzagIterator) HasNext() bool {
-	start := this.cur
-	for this.indexes[this.cur] == len(this.vectors[this.cur]) {
-		this.cur = (this.cur + 1) % this.size
-		if start == this.cur {
-			return false
-		}
-	}
-	return true
-}
-```
-
 <!-- tabs:end -->
 
 <!-- solution:end -->