feat: add No.739,2966

Author: BaffinLee

2901-3000/2966. Divide Array Into Arrays With Max Difference.md

@@ -0,0 +1,87 @@
+# 2966. Divide Array Into Arrays With Max Difference
+
+- Difficulty: Medium.
+- Related Topics: Array, Greedy, Sorting.
+- Similar Questions: .
+
+## Problem
+
+You are given an integer array `nums` of size `n` and a positive integer `k`.
+
+Divide the array into one or more arrays of size `3` satisfying the following conditions:
+
+
+	
+- **Each** element of `nums` should be in **exactly** one array.
+	
+- The difference between **any** two elements in one array is less than or equal to `k`.
+
+
+Return **a ****2D**** array containing all the arrays. If it is impossible to satisfy the conditions, return an empty array. And if there are multiple answers, return **any** of them.**
+
+ 
+Example 1:
+
+```
+Input: nums = [1,3,4,8,7,9,3,5,1], k = 2
+Output: [[1,1,3],[3,4,5],[7,8,9]]
+Explanation: We can divide the array into the following arrays: [1,1,3], [3,4,5] and [7,8,9].
+The difference between any two elements in each array is less than or equal to 2.
+Note that the order of elements is not important.
+```
+
+Example 2:
+
+```
+Input: nums = [1,3,3,2,7,3], k = 3
+Output: []
+Explanation: It is not possible to divide the array satisfying all the conditions.
+```
+
+ 
+**Constraints:**
+
+
+	
+- `n == nums.length`
+	
+- `1 <= n <= 105`
+	
+- `n` is a multiple of `3`.
+	
+- `1 <= nums[i] <= 105`
+	
+- `1 <= k <= 105`
+
+
+
+## Solution
+
+```javascript
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[][]}
+ */
+var divideArray = function(nums, k) {
+    nums.sort((a, b) => a - b);
+    var res = [];
+    for (var i = 0; i < nums.length; i += 3) {
+        if (nums[i + 2] - nums[i] <= k) {
+            res.push([nums[i], nums[i + 1], nums[i + 2]]);
+        } else {
+            return [];
+        }
+    }
+    return res;
+};
+```
+
+**Explain:**
+
+nope.
+
+**Complexity:**
+
+* Time complexity : O(n * log(n)).
+* Space complexity : O(n).

701-800/739. Daily Temperatures.md

@@ -0,0 +1,64 @@
+# 739. Daily Temperatures
+
+- Difficulty: Medium.
+- Related Topics: Array, Stack, Monotonic Stack.
+- Similar Questions: Next Greater Element I, Online Stock Span.
+
+## Problem
+
+Given an array of integers `temperatures` represents the daily temperatures, return **an array** `answer` **such that** `answer[i]` **is the number of days you have to wait after the** `ith` **day to get a warmer temperature**. If there is no future day for which this is possible, keep `answer[i] == 0` instead.
+
+ 
+Example 1:
+```
+Input: temperatures = [73,74,75,71,69,72,76,73]
+Output: [1,1,4,2,1,1,0,0]
+```Example 2:
+```
+Input: temperatures = [30,40,50,60]
+Output: [1,1,1,0]
+```Example 3:
+```
+Input: temperatures = [30,60,90]
+Output: [1,1,0]
+```
+ 
+**Constraints:**
+
+
+	
+- `1 <= temperatures.length <= 105`
+	
+- `30 <= temperatures[i] <= 100`
+
+
+
+## Solution
+
+```javascript
+/**
+ * @param {number[]} temperatures
+ * @return {number[]}
+ */
+var dailyTemperatures = function(temperatures) {
+    var stack = [];
+    var res = Array(temperatures.length).fill(0);
+    for (var i = 0; i < temperatures.length; i++) {
+        while (stack.length && temperatures[i] > temperatures[stack[stack.length - 1]]) {
+            var index = stack.pop();
+            res[index] = i - index;
+        }
+        stack.push(i);
+    }
+    return res;
+};
+```
+
+**Explain:**
+
+nope.
+
+**Complexity:**
+
+* Time complexity : O(n).
+* Space complexity : O(n).