- 博客(5)
- 收藏
- 关注
RSS订阅原创 229. Majority Element II
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.Note: The algorithm should run in linear time and in O(1) space.Example 1:Input: [3,2,3]Output: [3]Exa...
2018-12-28 12:43:48
119
转载 673. Number of Longest Increasing Subsequence
Given an unsorted array of integers, find the number of longest increasing subsequence.Example 1:Input: [1,3,5,4,7]Output: 2Explanation: The two longest increasing subsequence are [1, 3, 4, 7] ...
2018-12-25 22:50:57
132
原创 188. Best Time to Buy and Sell Stock IV
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 complete at most k transactions.Note:You may not eng...
2018-12-24 23:07:31
85
原创 see-123. Best Time to Buy and Sell Stock III
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 complete at most two transactions.Note: You may not e...
2018-12-24 22:31:27
312
原创 末尾0的个数
题目描述输入一个正整数n,求n!(即阶乘)末尾有多少个0？ 比如: n = 10; n! = 3628800,所以答案为2输入描述:输入为一行，n(1 ≤ n ≤ 1000)输出描述:输出一个整数,即题目所求示例1输入复制10输出复制2解析：能被5（5^1）整除的提供1个0能被25（5^2）整除的提供2个0能被125（5^3）...
2018-12-02 20:06:03
354
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人