import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;
import static util.Asserts.assertArrayEquals;
import static util.Asserts.assertNotNull;
/**
* æ ¹æ®æ¯æ—¥ 气温 列表，请é‡æ–°ç”Ÿæˆä¸€ä¸ªåˆ—表，对应ä½ç½®çš„è¾“å…¥æ˜¯ä½ éœ€è¦å†ç‰å¾…多久温度æ‰ä¼šå‡é«˜è¶…过该日的天数。
* 如果之åŽéƒ½ä¸ä¼šå‡é«˜ï¼Œè¯·åœ¨è¯¥ä½ç½®ç”¨ 0 æ¥ä»£æ›¿ã€‚
*
* 例如，给定一个列表 temperatures = [73, 74, 75, 71, 69, 72, 76, 73]ï¼Œä½ çš„è¾“å‡ºåº”è¯¥æ˜¯ [1, 1, 4, 2, 1, 1, 0, 0]。
*
* æ示：气温 列表长度的范围是 [1, 30000]。æ¯ä¸ªæ°”温的值的å‡ä¸ºåŽæ°åº¦ï¼Œéƒ½æ˜¯åœ¨ [30, 100] 范围内的整数。
*
*
* æ¥æºï¼šåŠ›æ‰£ï¼ˆLeetCode）
* 链接：https://leetcode-cn.com/problems/daily-temperatures
* 著作æƒå½’领扣网络所有。商业转载请è”系官方授æƒï¼Œéžå•†ä¸šè½¬è½½è¯·æ³¨æ˜Žå‡ºå¤„。
*
* @author abomb4 2020-01-12
*/
public class Solution739 {
public int[] dailyTemperatures(int[] t) {
// Store temperature and index
final int[] resultList = new int[t.length];
final TreeMap> map = new TreeMap<>();
for (int i = 0; i < t.length; i++) {
final int tem = t[i];
resultList[i] = 0;
final List list = map.get(tem);
if (list == null) {
final LinkedList l = new LinkedList<>();
l.add(i);
map.put(tem, l);
} else {
list.add(i);
}
final Iterator>> it = map.entrySet().iterator();
while (it.hasNext()) {
final Map.Entry> entry = it.next();
final Integer loopTem = entry.getKey();
final List loopIndexes = entry.getValue();
if (tem > loopTem) {
for (final Integer loopIndex : loopIndexes) {
resultList[loopIndex] = i - loopIndex;
}
it.remove();
} else {
break;
}
}
}
return resultList;
}
public static void main(String[] args) {
final Solution739 s = new Solution739();
{
final int[] tst = new int[]{73, 74, 75, 71, 69, 72, 76, 73};
final int[] rst = new int[]{1, 1, 4, 2, 1, 1, 0, 0};
final int[] result = s.dailyTemperatures(tst);
assertNotNull(result, "结果1");
assertArrayEquals(rst, result, "计算1");
}
{
final int[] tst = new int[]{89, 62, 70, 58, 47, 47, 46, 76, 100, 70};
final int[] rst = new int[]{8, 1, 5, 4, 3, 2, 1, 1, 0, 0};
final int[] result = s.dailyTemperatures(tst);
assertNotNull(result, "结果2");
assertArrayEquals(rst, result, "计算2");
}
System.out.println("OK");
}
}