2017年10月16日
LeetCode 624. Maximum Distance in Arrays （在数组中的最大距离）$
摘要： Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each array picks one) and cal 阅读全文
posted @ 2017-10-16 11:20 Jimmy_Cheng 阅读(266) 评论(0) 推荐(0)
LeetCode 605. Can Place Flowers （可以种花）
摘要： Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they 阅读全文
posted @ 2017-10-16 07:28 Jimmy_Cheng 阅读(345) 评论(0) 推荐(0)