Create Solution3.go

Author: yanglbme

solution/1400-1499/1438.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit/Solution3.go

@@ -0,0 +1,83 @@
+func longestSubarray(nums []int, limit int) int {
+	var maxq, minq Deque
+	n := len(nums)
+	l := 0
+	for r, x := range nums {
+		for !maxq.Empty() && nums[maxq.Back()] < x {
+			maxq.PopBack()
+		}
+		for !minq.Empty() && nums[minq.Back()] > x {
+			minq.PopBack()
+		}
+		maxq.PushBack(r)
+		minq.PushBack(r)
+
+		if nums[maxq.Front()]-nums[minq.Front()] > limit {
+			l++
+			if maxq.Front() < l {
+				maxq.PopFront()
+			}
+			if minq.Front() < l {
+				minq.PopFront()
+			}
+		}
+	}
+	return n - l
+}
+
+type Deque struct{ l, r []int }
+
+func (q Deque) Empty() bool {
+	return len(q.l) == 0 && len(q.r) == 0
+}
+
+func (q Deque) Size() int {
+	return len(q.l) + len(q.r)
+}
+
+func (q *Deque) PushFront(v int) {
+	q.l = append(q.l, v)
+}
+
+func (q *Deque) PushBack(v int) {
+	q.r = append(q.r, v)
+}
+
+func (q *Deque) PopFront() (v int) {
+	if len(q.l) > 0 {
+		q.l, v = q.l[:len(q.l)-1], q.l[len(q.l)-1]
+	} else {
+		v, q.r = q.r[0], q.r[1:]
+	}
+	return
+}
+
+func (q *Deque) PopBack() (v int) {
+	if len(q.r) > 0 {
+		q.r, v = q.r[:len(q.r)-1], q.r[len(q.r)-1]
+	} else {
+		v, q.l = q.l[0], q.l[1:]
+	}
+	return
+}
+
+func (q Deque) Front() int {
+	if len(q.l) > 0 {
+		return q.l[len(q.l)-1]
+	}
+	return q.r[0]
+}
+
+func (q Deque) Back() int {
+	if len(q.r) > 0 {
+		return q.r[len(q.r)-1]
+	}
+	return q.l[0]
+}
+
+func (q Deque) Get(i int) int {
+	if i < len(q.l) {
+		return q.l[len(q.l)-1-i]
+	}
+	return q.r[i-len(q.l)]
+}