yangshi1111的博客

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);

第一种比较直接的想法，但往往不是最简单的，先排序然后一个一个对应，但往往这种情况下不会是最好的办法static bool comp(int a, int b) { return !(a<b); } int hIndex(vector<int>& citations) { citations.push_back(INT_MAX); sort(citations.begin()

leetcode

动态规划最基本的题，模板题，记得max和temp的初始化，初始化第一个元素就行，不用初始化INT_MINint maxSubArray(vector<int>& nums) { int max=nums[0],i,temp=nums[0]; //注意套路 for(i=1;i<nums.size();i++) {

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

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