- 博客(9)
- 资源 (1)
- 收藏
- 关注
原创 *Leetcode 813. Largest Sum of Averages | dp
https://leetcode.com/problems/largest-sum-of-averages/description/意外竟然可以n^2*k A掉。。。class Solution {public: double largestSumOfAverages(vector<int>& A, int K) { int n = A.size();...
2018-05-08 02:58:06 449
原创 *Leetcode 357. Count Numbers with Unique Digits | 思维 规律
https://leetcode.com/problems/count-numbers-with-unique-digits/description/最暴力的写法:如果位数n >= 10,那么其实真正有效的也就10位。分两种情况,(1)第一位不是0,那么总的种数是 9 * 9 * 8 * 7 。。。(2)第一位是0, 总的种数要枚举先导0的个数,具体计算跟(1)一样,如果说这个题是dp题的话...
2018-05-08 00:23:34 145
原创 **Leetcode 740. Delete and Earn
https://leetcode.com/problems/delete-and-earn/description/跟买卖股票的还是一样的思路。参考率 https://leetcode.com/problems/delete-and-earn/discuss/123634/C++-9ms-DP-solution class Solution {public: int deleteAndE...
2018-05-07 23:33:26 231
原创 ***LintCode 1365. Minimum Cycle Section | kmp 据说是头条的笔试题第一题
https://www.lintcode.com/problem/minimum-cycle-section/description这题据说是头条笔试第一题,看了下 对非ACMer而言,或者我这种比较菜 而且忘得差不多的 真是有点难啊......参考了这里 https://www.jiuzhang.com/solution/minimum-cycle-section/复习一下kmp:next[i]...
2018-05-07 22:47:15 539
原创 **Leetcode 464. Can I Win | 游戏 状压dp
https://leetcode.com/problems/can-i-win/description/参考了这里 https://leetcode.com/problems/can-i-win/discuss/95320/7-liner-C++-beat-98.4-DFS-with-early-termination-check-(detailed-explanation)看数据规模能猜测到是状...
2018-05-07 21:46:47 290
原创 **Leetcode 523. Continuous Subarray Sum | dp+鸽笼原理
https://leetcode.com/problems/continuous-subarray-sum/description/https://leetcode.com/problems/continuous-subarray-sum/discuss/99512/Python-with-explanation.-62ms-Time-O(min(n-k))-mostly 这里讲解的很好。其实关...
2018-05-06 12:43:15 168
原创 合法括号配对的个数 | dp
网上看到的一个笔试题一个合法的表达式由()包围,()可以嵌套和连接,如(())()也是合法 表达式;现在有 6 对(),它们可以组成的合法表达式的个数为____dp[i][j]表示,长度为i的表达式,左括号比右括号多j个的情况数。那么Ans=dp[n][0]#include <iostream>#include <cstring>#include <cstdio&...
2018-05-04 18:43:40 2171
原创 *Leetcode 377. Combination Sum IV | dp
https://leetcode.com/problems/combination-sum-iv/description/比较直白的递推了class Solution {public: int combinationSum4(vector<int>& nums, int target) { vector<int> dp(target+1, ...
2018-05-04 02:24:36 127
原创 Leetcode 402. Remove K Digits | 思维 贪心
https://leetcode.com/problems/remove-k-digits/description/刷面经的时候刷到的,想了下 贪心可做。看前k+1位,哪个最小就选哪个,为了让这个最小的在最前,需要删除t位,删除之后,问题变成 从剩下的数字里,删除k-t个,获得最小的,于是dfs。 实际感觉有一些不好错误数据,OJ上。比如Input: num = "10200", k = 1Ou...
2018-05-04 01:50:50 205
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人