2020年8月17日
123. Best Time to Buy and Sell Stock III - Hard
摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2020-08-17 10:31 fatttcat 阅读(97) 评论(0) 推荐(0)
435. Non-overlapping Intervals - Medium
摘要： Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Example 1: 阅读全文
posted @ 2020-08-17 08:56 fatttcat 阅读(124) 评论(0) 推荐(0)
274. H-Index - Medium
摘要： Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. According 阅读全文
posted @ 2020-08-17 07:41 fatttcat 阅读(150) 评论(0) 推荐(0)