leetCode练习（40）

最新推荐文章于 2020-09-24 21:14:42 发布

碰碰猪

最新推荐文章于 2020-09-24 21:14:42 发布

阅读量230

点赞数

分类专栏： leetCode 文章标签： backtracking java leetcode 回溯法

本文链接：https://blog.csdn.net/u010771890/article/details/52667355

版权

leetCode 专栏收录该内容

150 篇文章 0 订阅

订阅专栏

题目：Combination Sum II

难度：medium

问题描述：

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.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

For example, given candidate set [10, 1, 2, 7, 6, 1, 5] and target 8,
A solution set is:

[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

解题思路：

这题与39题思路完全相同，而且代码部分只要改两步，一是nums里的每个元素只能使用此次，在回溯时修改初始索引即可。二是这样之前防止出现相同解的判断也要稍微修改。

具体代码如下：

package leetCode_medium;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class m_40_CombinationSum2 {
	ArrayList
   
   
    
    
     
     > list=new ArrayList
     
     
      
      
       
       >();
	public List
       
        
        
          > combinationSum(int[] candidates, int target) { Arrays.sort(candidates); backtracking(candidates,0,target,new ArrayList 
         
           ()); return list; } public void backtracking(int[] nums,int index,int target,ArrayList 
          
            alist){ int len=nums.length; if(index>=nums.length) return; if(nums[index]>target) return; if(target>len*nums[len-1]){ return ; } for(int i=index;i 
           
             index&&nums[i]==nums[i-1]){ continue; } ArrayList 
            
              temp=(ArrayList 
             
               )alist.clone(); temp.add(nums[i]); // show(temp); if(nums[i]==target){ //show(temp); list.add(temp); return; }else{ backtracking(nums,i+1,target-nums[i],temp); } } } public static void main(String[]args){ m_39_CombinationSum s=new m_39_CombinationSum(); int[] nums={1,1,2,4,7}; s.backtracking(nums,0,7,new ArrayList 
              
                ()); System.out.println("result:"); for(int i=0;i