feat: update solutions to lcof problems: No. 59 - I,59 - II

Author: maolonglong

lcof/面试题59 - I. 滑动窗口的最大值/README.md

@@ -122,6 +122,54 @@ var maxSlidingWindow = function (nums, k) {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
+        vector<int> ans;
+        deque<int> window;
+        int n = nums.size();
+        for (int i = 0; i < n; ++i) {
+            while (!window.empty() && nums[window.back()] <= nums[i]) {
+                window.pop_back();
+            }
+            window.push_back(i);
+            if (window.front() == i - k) {
+                window.pop_front();
+            }
+            if (i >= k - 1) {
+                ans.push_back(nums[window.front()]);
+            }
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func maxSlidingWindow(nums []int, k int) []int {
+	ans := make([]int, 0, len(nums)-k+1)
+	window := make([]int, 0)
+	for i, num := range nums {
+		for len(window) != 0 && nums[window[len(window)-1]] <= num {
+			window = window[:len(window)-1]
+		}
+		window = append(window, i)
+		if window[0] == i-k {
+			window = window[1:]
+		}
+		if i >= k-1 {
+			ans = append(ans, nums[window[0]])
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

lcof/面试题59 - I. 滑动窗口的最大值/Solution.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
+        vector<int> ans;
+        deque<int> window;
+        int n = nums.size();
+        for (int i = 0; i < n; ++i) {
+            while (!window.empty() && nums[window.back()] <= nums[i]) {
+                window.pop_back();
+            }
+            window.push_back(i);
+            if (window.front() == i - k) {
+                window.pop_front();
+            }
+            if (i >= k - 1) {
+                ans.push_back(nums[window.front()]);
+            }
+        }
+        return ans;
+    }
+};

lcof/面试题59 - I. 滑动窗口的最大值/Solution.go

@@ -0,0 +1,17 @@
+func maxSlidingWindow(nums []int, k int) []int {
+	ans := make([]int, 0, len(nums)-k+1)
+	window := make([]int, 0)
+	for i, num := range nums {
+		for len(window) != 0 && nums[window[len(window)-1]] <= num {
+			window = window[:len(window)-1]
+		}
+		window = append(window, i)
+		if window[0] == i-k {
+			window = window[1:]
+		}
+		if i >= k-1 {
+			ans = append(ans, nums[window[0]])
+		}
+	}
+	return ans
+}

lcof/面试题59 - II. 队列的最大值/README.md

@@ -173,6 +173,81 @@ MaxQueue.prototype.pop_front = function () {
 };
 ```
 
+### **C++**
+
+```cpp
+class MaxQueue {
+private:
+    queue<int> q;
+    deque<int> d;
+
+public:
+    MaxQueue() {}
+
+    int max_value() {
+        if (d.empty()) return -1;
+        return d.front();
+    }
+
+    void push_back(int value) {
+        while (!d.empty() && d.back() < value) d.pop_back();
+        d.push_back(value);
+        q.push(value);
+    }
+
+    int pop_front() {
+        if (d.empty()) return -1;
+        int retVal = q.front();
+        q.pop();
+        if (d.front() == retVal) d.pop_front();
+        return retVal;
+    }
+};
+```
+
+### **Go**
+
+```go
+type MaxQueue struct {
+	queue []int
+	deque []int
+}
+
+func Constructor() MaxQueue {
+	return MaxQueue{
+		queue: make([]int, 0),
+		deque: make([]int, 0),
+	}
+}
+
+func (this *MaxQueue) Max_value() int {
+	if len(this.deque) == 0 {
+		return -1
+	}
+	return this.deque[0]
+}
+
+func (this *MaxQueue) Push_back(value int) {
+	for len(this.deque) != 0 && this.deque[len(this.deque)-1] < value {
+		this.deque = this.deque[:len(this.deque)-1]
+	}
+	this.deque = append(this.deque, value)
+	this.queue = append(this.queue, value)
+}
+
+func (this *MaxQueue) Pop_front() int {
+	if len(this.deque) == 0 {
+		return -1
+	}
+	retVal := this.queue[0]
+	this.queue = this.queue[1:]
+	if this.deque[0] == retVal {
+		this.deque = this.deque[1:]
+	}
+	return retVal
+}
+```
+
 ### **...**
 
 ```

lcof/面试题59 - II. 队列的最大值/Solution.cpp

@@ -0,0 +1,27 @@
+class MaxQueue {
+private:
+    queue<int> q;
+    deque<int> d;
+
+public:
+    MaxQueue() {}
+
+    int max_value() {
+        if (d.empty()) return -1;
+        return d.front();
+    }
+
+    void push_back(int value) {
+        while (!d.empty() && d.back() < value) d.pop_back();
+        d.push_back(value);
+        q.push(value);
+    }
+
+    int pop_front() {
+        if (d.empty()) return -1;
+        int retVal = q.front();
+        q.pop();
+        if (d.front() == retVal) d.pop_front();
+        return retVal;
+    }
+};

lcof/面试题59 - II. 队列的最大值/Solution.go

@@ -0,0 +1,38 @@
+type MaxQueue struct {
+	queue []int
+	deque []int
+}
+
+func Constructor() MaxQueue {
+	return MaxQueue{
+		queue: make([]int, 0),
+		deque: make([]int, 0),
+	}
+}
+
+func (this *MaxQueue) Max_value() int {
+	if len(this.deque) == 0 {
+		return -1
+	}
+	return this.deque[0]
+}
+
+func (this *MaxQueue) Push_back(value int) {
+	for len(this.deque) != 0 && this.deque[len(this.deque)-1] < value {
+		this.deque = this.deque[:len(this.deque)-1]
+	}
+	this.deque = append(this.deque, value)
+	this.queue = append(this.queue, value)
+}
+
+func (this *MaxQueue) Pop_front() int {
+	if len(this.deque) == 0 {
+		return -1
+	}
+	retVal := this.queue[0]
+	this.queue = this.queue[1:]
+	if this.deque[0] == retVal {
+		this.deque = this.deque[1:]
+	}
+	return retVal
+}