Commitad74745

committed

add a solution for 77

1 parent59b6945 commitad74745Copy full SHA for ad74745

File tree

+30

-0

lines changed

src
- main/java/com/fishercoder/solutions
  - _77.java
- test/java/com/fishercoder
  - _77Test.java

+30

-0

lines changed

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,4 +31,31 @@ private void backtracking(List<Integer> list, int k, int start, int limit, List<`
`31`	`31`	`}`
`32`	`32`	`}`
`33`	`33`	`}`
	`34`	`+`
	`35`	`+publicstaticclassSolution2 {`
	`36`	`+/**`
	`37`	`+ * My completely own solution on 1/24/2022.`
	`38`	`+ */`
	`39`	`+publicList<List<Integer>>combine(intn,intk) {`
	`40`	`+List<List<Integer>>ans =newArrayList<>();`
	`41`	`+int[]nums =newint[n];`
	`42`	`+for (inti =1;i <=n;i++) {`
	`43`	`+nums[i -1] =i;`
	`44`	`+ }`
	`45`	`+backtrack(ans,nums,k,newArrayList<>(),0);`
	`46`	`+returnans;`
	`47`	`+ }`
	`48`	`+`
	`49`	`+privatevoidbacktrack(List<List<Integer>>ans,int[]nums,intk,List<Integer>curr,intstart) {`
	`50`	`+if (curr.size() ==k) {`
	`51`	`+ans.add(newArrayList<>(curr));`
	`52`	`+ }elseif (curr.size() <k) {`
	`53`	`+for (inti =start;i <nums.length;i++) {`
	`54`	`+curr.add(nums[i]);`
	`55`	`+backtrack(ans,nums,k,curr,i +1);`
	`56`	`+curr.remove(curr.size() -1);`
	`57`	`+ }`
	`58`	`+ }`
	`59`	`+ }`
	`60`	`+ }`
`34`	`61`	`}`

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,14 +7,17 @@`
`7`	`7`
`8`	`8`	`publicclass_77Test {`
`9`	`9`	`privatestatic_77.Solution1solution1;`
	`10`	`+privatestatic_77.Solution2solution2;`
`10`	`11`
`11`	`12`	`@BeforeClass`
`12`	`13`	`publicstaticvoidsetup() {`
`13`	`14`	`solution1 =new_77.Solution1();`
	`15`	`+solution2 =new_77.Solution2();`
`14`	`16`	`}`
`15`	`17`
`16`	`18`	`@Test`
`17`	`19`	`publicvoidtest1() {`
`18`	`20`	`CommonUtils.printListList(solution1.combine(4,2));`
	`21`	`+CommonUtils.printListList(solution2.combine(4,2));`
`19`	`22`	`}`
`20`	`23`	`}`

Comments

(0)