feat: add solutions to lc problem: No.0281

No.0281.Zigzag Iterator

Author: taoyq1988

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

@@ -207,6 +207,46 @@ 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 -->

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

@@ -221,6 +221,46 @@ 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 -->

solution/0200-0299/0281.Zigzag Iterator/Solution.go

@@ -0,0 +1,35 @@
+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
+}