[N-0] add 739

Author: fishercoder1534

README.md

@@ -22,6 +22,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
+|739|[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_739.java) | O(n^2) | O(1) | Medium| 
 |737|[Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_737.java) | O(nlogk + k) n is the length of max(words1, words2), k is the length of pairs| O(k) | Medium| Union Find
 |735|[Asteroid Collision](https://leetcode.com/problems/asteroid-collision/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_735.java) | O(n) | O(n) | Medium | Stack
 |734|[Sentence Similarity](https://leetcode.com/problems/sentence-similarity/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_734.java) | O(n*k) | O(1) | Easy | HashTable

src/main/java/com/fishercoder/solutions/_739.java

@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+/**
+ * 739. Daily Temperatures
+ *
+ * Given a list of daily temperatures, produce a list that,
+ * for each day in the input, tells you how many days you would have to wait until a warmer temperature.
+ * If there is no future day for which this is possible, put 0 instead.
+ * For example, given the list temperatures = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].
+ *
+ * Note: The length of temperatures will be in the range [1, 30000]. Each temperature will be an integer in the range [30, 100].
+ */
+public class _739 {
+
+    public static class Solution1 {
+        public int[] dailyTemperatures(int[] temperatures) {
+            if (temperatures == null || temperatures.length == 0) {
+                return temperatures;
+            }
+            int[] result = new int[temperatures.length];
+            for (int i = 0; i < temperatures.length; i++) {
+                for (int j = i + 1; j < temperatures.length; j++) {
+                    if (temperatures[j] > temperatures[i]) {
+                        result[i] = j - i;
+                        break;
+                    }
+                }
+            }
+            return result;
+        }
+    }
+}

src/test/java/com/fishercoder/_739Test.java

@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._739;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _739Test {
+    private static _739.Solution1 solution1;
+    private static int[] temperatures;
+    private static int[] expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _739.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        temperatures = new int[]{73, 74, 75, 71, 69, 72, 76, 73};
+        expected = new int[]{1, 1, 4, 2, 1, 1, 0, 0};
+        assertArrayEquals(expected, solution1.dailyTemperatures(temperatures));
+    }
+
+}