solve problem Daily Temperatures

Author: P-ppc

README.md

@@ -301,6 +301,7 @@ All solutions will be accepted!
 |134|[Gas Station](https://leetcode-cn.com/problems/gas-station/description/)|[java/py/js](./algorithms/GasStation)|Medium|
 |238|[Product Of Array Except Self](https://leetcode-cn.com/problems/product-of-array-except-self/description/)|[java/py/js](./algorithms/ProductOfArrayExceptSelf)|Medium|
 |896|[Monotonic Array](https://leetcode-cn.com/problems/monotonic-array/description/)|[java/py/js](./algorithms/MonotonicArray)|Easy|
+|739|[Daily Temperatures](https://leetcode-cn.com/problems/daily-temperatures/description/)|[java/py/js](./algorithms/DailyTemperatures)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/DailyTemperatures/README.md

@@ -0,0 +1,2 @@
+# Daily Temperatures
+We can solve this problem by stack and hashmap

algorithms/DailyTemperatures/Solution.java

@@ -0,0 +1,20 @@
+class Solution {
+    public int[] dailyTemperatures(int[] temperatures) {
+        int length = temperatures.length;
+        int[] res = new int[length];
+        LinkedList<Map<String, Integer>> stack = new LinkedList<Map<String, Integer>>();
+        
+        for (int i = 0; i < length; i++) {
+            while (stack.size() > 0 && stack.peek().get("value") < temperatures[i]) {
+                Map<String, Integer> e = stack.pop();
+                res[e.get("index")] = i - e.get("index");
+            }
+            Map<String, Integer> e = new HashMap<String, Integer>();
+            e.put("index", i);
+            e.put("value", temperatures[i]);
+            stack.push(e);
+        }
+        
+        return res;
+    }
+}

algorithms/DailyTemperatures/solution.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} temperatures
+ * @return {number[]}
+ */
+var dailyTemperatures = function(temperatures) {
+    let length = temperatures.length,
+        res = new Array(length),
+        stack = []
+    res.fill(0)
+    
+    for (let i = 0; i < length; i++) {
+        while (stack.length > 0 && stack[stack.length - 1].value < temperatures[i]) {
+            let e = stack.pop()
+            res[e.index] = i - e.index
+        }
+        stack.push({ index: i, value: temperatures[i] })
+    }
+    
+    return res
+};

algorithms/DailyTemperatures/solution.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def dailyTemperatures(self, temperatures):
+        """
+        :type temperatures: List[int]
+        :rtype: List[int]
+        """
+        length = len(temperatures)
+        res = [0] * length
+        stack = []
+        
+        for i in xrange(length):
+            while len(stack) > 0 and stack[-1]['value'] < temperatures[i]:
+                e = stack.pop()
+                res[e['index']] = i - e['index']
+            stack.append({ 'index': i, 'value': temperatures[i] })
+            
+        return res