![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
yangshi1111
这个作者很懒,什么都没留下…
展开
-
leetcode 39. Combination Sum
vector<vector<int>> ans; vector<int> newsequece; int aim; void dfs(int sum, int i, vector<int>& temp) { if (sum == aim) { ans.push_back(temp);原创 2017-05-22 22:13:03 · 206 阅读 · 0 评论 -
leetcode 274. H-Index
第一种比较直接的想法,但往往不是最简单的,先排序然后一个一个对应,但往往这种情况下不会是最好的办法static bool comp(int a, int b){ return !(a<b);}int hIndex(vector<int>& citations) { citations.push_back(INT_MAX); sort(citations.begin()原创 2017-05-23 16:23:17 · 239 阅读 · 0 评论 -
leetcode 581. Shortest Unsorted Continuous Subarray
leetcode原创 2017-05-17 17:55:57 · 544 阅读 · 0 评论 -
leetcode 53. Maximum Subarray
动态规划最基本的题,模板题,记得max和temp的初始化,初始化第一个元素就行,不用初始化INT_MINint maxSubArray(vector<int>& nums) { int max=nums[0],i,temp=nums[0]; //注意套路 for(i=1;i<nums.size();i++) {原创 2017-05-17 20:08:07 · 234 阅读 · 0 评论 -
leetcode 152.Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the la原创 2017-05-18 19:59:42 · 275 阅读 · 0 评论 -
leetcode 582.Kill Process
Given n processes, each process has a unique PID (process id) and its PPID (parent process id). Each process only has one parent process, but may have one or more children processes. This is原创 2017-05-19 21:57:44 · 348 阅读 · 0 评论