2017年10月30日
Leetcode 719. Find K-th Smallest Pair Distance (binary search)
摘要： Brute force First, it's easy to find out a brute force solution: First, enumerate all the pairs nums[i] and nums[j], the total number is $O(n^2)$ Seco 阅读全文
posted @ 2017-10-30 16:19 Caesiumlz 阅读(136) 评论(0) 推荐(0)
2017年10月28日
Leetcode 714. Best Time to Buy and Sell Stock with Transaction Fee (dp)
摘要： The solutions of the series of Best Time to Buy and Sell Stock are nearly the same by simply using dynamic programming. Just with some modifying. Stat 阅读全文
posted @ 2017-10-28 16:53 Caesiumlz 阅读(552) 评论(0) 推荐(0)