LeetCode的medium题集合(C++实现)五

1 Combination Sum

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C unlimited number of times.

可以采用递归的方法解决这个问题,当找到一组数之和等于目标后将这组数加入容器,然后返回;当一组数之和大于目标,立即返回;当小于目标继续递归。

void dfscombine(vector<int>& candidates,int level,int& sum,int target,vector<int>& mid,vector<vector<int> >& result)
    {
        if(sum>target) return;
        else if(sum==target)
        {
           result.push_back(mid);
           return;
        }
        else
        {
          for(int i=level;i<candidates.size();i++)
          {
              sum+=candidates[i];
              mid.push_back(candidates[i]);
              dfscombine(candidates,i,sum,target,mid,result);
              mid.pop_back();
              sum-=candidates[i];
          }
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<int> mid;
        vector<vector<int> > result;
        sort(candidates.begin(),candidates.end());
        int level=0,sum=0;
        dfscombine(candidates,level,sum,target,mid,result);
        return result;
    }

2 Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in the combination.

该题与上一题的区别是给定的数据集中的数据只能用一次,我只需将上题中递归的参数level=i 改为 level=i+1 即可。同时,与前面讲过的3sum等问题类似,防止从容器中pop_back() 出来的数与即将加入容器中的数相等而造成重复。

void dfscombine(vector<int>& candidates,int level,int& sum,int target,vector<int>& mid,vector<vector<int> >& result)
    {
        if(sum>target) return;
        else if(sum==target)
           result.push_back(mid);
        else
        {
          for(int i=level;i<candidates.size();i++)
          {
              sum+=candidates[i];
              mid.push_back(candidates[i]);
              dfscombine(candidates,i+1,sum,target,mid,result); //保证一个元素只用一次
              mid.pop_back();
              sum-=candidates[i];
              while(i<candidates.size()-1 && candidates[i]== candidates[i+1]) i++;  //防止重复
          }
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<int> mid;
        vector<vector<int> > result;
        sort(candidates.begin(),candidates.end());
        int level=0,sum=0;
        dfscombine(candidates,level,sum,target,mid,result);
        return result;
    }
时间: 2024-11-05 12:32:58

LeetCode的medium题集合(C++实现)五的相关文章

LeetCode的medium题集合(C++实现)十五

1 Subsets Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets. For example,If nums = [1,2,3], a solution is: [ [3], [1],

LeetCode的medium题集合(C++实现)十一

1 Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked

LeetCode的medium题集合(C++实现)六

1 Multiply Strings Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative. 该题实际就是利用字符串来解决大数的乘法问题.为了计算方便先将两组数翻转,将字符串转化为整数利用两个循环逐位相乘,将结果保存.然后逐位解决进位问题. s

LeetCode的medium题集合(C++实现)四

1 Next Permutation Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending or

LeetCode的medium题集合(C++实现)九

1 Jump Game Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you are able to reach the last index. 利用两指针法

LeetCode的medium题集合(C++实现)八

1 Pow(x, n) 该题采用二分法进行递归 double myPow(double x, int n) { if(n==0) return 1; if(n<0) { n=(-n); x=1/x; } double res=myPow(x,n/2); if(n%2==0) { return res*res; } else { return res*res*x; } } 2 Maximum Subarray Find the contiguous subarray within an array

LeetCode的medium题集合(C++实现)十

1 Permutation Sequence The set [1,2,3,-,n] contains a total of n! unique permutations.Given n and k, return the kth permutation sequence. 使用Next Permutation循环k次可以得到序列,但leetcode上提交会出现时间超过限制.下面采用数学法: 在n!个排列中,第一位元素相同的排列总是有(n?1)!个,如果p=k/(n?1)!,那么排列的第一位元素

LeetCode的medium题集合(C++实现)十七

1 Partition List Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the two partitions.For example: Give

LeetCode的medium题集合(C++实现)十四

1 Sort Colors Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0, 1, and 2 to represent the color red,