Commit59a728e

committed

Fixed

1 parent3a6ffe2 commit59a728eCopy full SHA for 59a728e

File tree

+43

-9

lines changed

+43

-9

lines changed

Lines changed: 24 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,28 @@`
`1`		`-classSolution:`
`2`		`-# @return a list of lists of integers`
	`1`	`+"""`
	`2`	`+Given two integers n and k, return all possible combinations of k numbers out`
	`3`	`+of 1 ... n.`
	`4`	`+`
	`5`	`+For example,`
	`6`	`+If n = 4 and k = 2, a solution is:`
	`7`	`+`
	`8`	`+[`
	`9`	`+ [2,4],`
	`10`	`+ [3,4],`
	`11`	`+ [2,3],`
	`12`	`+ [1,2],`
	`13`	`+ [1,3],`
	`14`	`+ [1,4],`
	`15`	`+]`
	`16`	`+"""`
	`17`	`+`
	`18`	`+`
	`19`	`+classSolution(object):`
`3`	`20`	`defcombine(self,n,k):`
	`21`	`+"""`
	`22`	`+ :type n: int`
	`23`	`+ :type k: int`
	`24`	`+ :rtype: List[List[int]]`
	`25`	`+ """`
`4`	`26`	`a=range(1,n+1)`
`5`	`27`	`returnself.combine_aux(a,k)`
`6`	`28`

Lines changed: 19 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,13 +1,25 @@`
`1`		`-classSolution:`
`2`		`-# @param num, a list of integer`
`3`		`-# @return a list of lists of integers`
`4`		`-defpermute(self,num):`
`5`		`-ifnotnum:`
	`1`	`+"""`
	`2`	`+Given a collection of numbers, return all possible permutations.`
	`3`	`+`
	`4`	`+For example,`
	`5`	`+[1,2,3] have the following permutations:`
	`6`	`+[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].`
	`7`	`+`
	`8`	`+"""`
	`9`	`+`
	`10`	`+`
	`11`	`+classSolution(object):`
	`12`	`+defpermute(self,nums):`
	`13`	`+"""`
	`14`	`+ :type nums: List[int]`
	`15`	`+ :rtype: List[List[int]]`
	`16`	`+ """`
	`17`	`+ifnotnums:`
`6`	`18`	`return [[]]`
`7`	`19`	`else:`
`8`	`20`	`res= []`
`9`		`-fori,einenumerate(num):`
`10`		`-rest=num[:i]+num[i+1:]`
	`21`	`+fori,einenumerate(nums):`
	`22`	`+rest=nums[:i]+nums[i+1:]`
`11`	`23`	`rest_perms=self.permute(rest)`
`12`	`24`	`forperminrest_perms:`
`13`	`25`	`perm.append(e)`

Comments

(0)