2018年8月30日

121. Best Time to Buy and Sell Stock
摘要： Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2018-08-30 17:03 jydd 阅读(61) 评论(0) 推荐(0)
53. Maximum Subarray
摘要： Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Follow up: If 阅读全文
posted @ 2018-08-30 16:34 jydd 阅读(57) 评论(0) 推荐(0)
64. Minimum Path Sum
摘要： Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2018-08-30 15:53 jydd 阅读(84) 评论(0) 推荐(0)
28. Implement strStr()
摘要： Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Clarification: What shoul 阅读全文
posted @ 2018-08-30 11:08 jydd 阅读(58) 评论(0) 推荐(0)

导航