Algorithm
- 824. Goat Latin - LeetCode
- 152. Maximum Product Subarray - LeetCode
- 110. Balanced Binary Tree - LeetCode
- 67. Two Sum II - Input array is sorted - LeetCode
- 665. Non-decreasing Array - LeetCode
Review
软件工程是团队运动。真正 10x 的开发者让身边的人看起来也像是 10x 的开发者。好的球员可以接到队友传得很烂的球，好的球员传出去的球也能让队友很舒服地接到。 by Wanqu 湾区日报
Tip
Java8遍历一个时间段
LocalDate dateBegin = LocalDate.parse("2017-03-01", DateTimeFormatter.ISO_LOCAL_DATE);
LocalDate dateEnd = null;
dateEnd = LocalDate.now();
String key = null;
while (dateEnd.compareTo(dateBegin) >= 0) {
key = dateEnd.format(DateTimeFormatter.ISO_LOCAL_DATE);
dateEnd = dateEnd.minusDays(1);
System.err.println(key);
}
Date与LocalDate想到转换
// Date => LocalDate
Date date = new Date();
Instant instant = date.toInstant();
ZoneId zoneId = ZoneId.systemDefault();
// atZone()方法返回在指定时区从此Instant生成的ZonedDateTime。
LocalDate localDate = instant.atZone(zoneId).toLocalDate();
// LocalDate => Date
ZoneId zoneId = ZoneId.systemDefault();
LocalDate localDate = LocalDate.now();
ZonedDateTime zdt = localDate.atStartOfDay(zoneId);
Date date = Date.from(zdt.toInstant());