@@ -286,8 +286,70 @@ class Solution {
286286}
287287
288288```
289+ ** 90.子集II**
290+ ``` java
291+ class Solution {
292+ List<List<Integer > > reslut = new ArrayList<> ();
293+ LinkedList<Integer > path = new LinkedList<> ();
294+ 295+ public List<List<Integer > > subsetsWithDup (int [] nums ) {
296+ if (nums. length == 0 ){
297+ reslut. add(path);
298+ return reslut;
299+ }
300+ Arrays . sort(nums);
301+ backtracking(nums,0 );
302+ return reslut;
303+ }
289304
305+ public void backtracking (int [] nums ,int startIndex ){
306+ reslut. add(new ArrayList<> (path));
307+ if (startIndex >= nums. length)return ;
308+ HashSet<Integer > hashSet = new HashSet<> ();
309+ for (int i = startIndex; i < nums. length; i++ ){
310+ if (hashSet. contains(nums[i])){
311+ continue ;
312+ }
313+ hashSet. add(nums[i]);
314+ path. add(nums[i]);
315+ backtracking(nums,i+ 1 );
316+ path. removeLast();
317+ }
318+ }
319+ }
320+ ```
321+ ** 40.组合总和II**
322+ ``` java
323+ class Solution {
324+ List<List<Integer > > result = new ArrayList<> ();
325+ LinkedList<Integer > path = new LinkedList<> ();
326+ public List<List<Integer > > combinationSum2 (int [] candidates , int target ) {
327+ Arrays . sort( candidates );
328+ if ( candidates[0 ] > target ) return result;
329+ backtracking(candidates,target,0 ,0 );
330+ return result;
331+ }
290332
333+ public void backtracking (int [] candidates ,int target ,int sum ,int startIndex ){
334+ if ( sum > target )return ;
335+ if ( sum == target ){
336+ result. add( new ArrayList<> (path) );
337+ }
338+ HashSet<Integer > hashSet = new HashSet<> ();
339+ for ( int i = startIndex; i < candidates. length; i++ ){
340+ if ( hashSet. contains(candidates[i]) ){
341+ continue ;
342+ }
343+ hashSet. add(candidates[i]);
344+ path. add(candidates[i]);
345+ sum += candidates[i];
346+ backtracking(candidates,target,sum,i+ 1 );
347+ path. removeLast();
348+ sum -= candidates[i];
349+ }
350+ }
351+ }
352+ ```
291353Python:
292354
293355** 90.子集II**
0 commit comments