摘要：
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the 阅读全文
posted @ 2017-09-23 16:27
__Meng
阅读(114)
评论(0)
推荐(0)
摘要：
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 @ 2017-09-23 15:53
__Meng
阅读(140)
评论(0)
推荐(0)
摘要：
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 @ 2017-09-23 15:25
__Meng
阅读(136)
评论(0)
推荐(0)
摘要：
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1]. Note:Could you optimize your algorithm to us 阅读全文
posted @ 2017-09-23 14:58
__Meng
阅读(146)
评论(0)
推荐(0)
浙公网安备 33010602011771号