classSolution(object):

defpermute(self,nums):

result= []

self.get_permute([],nums,result)

defget_permute(self,current,num,result):

ifnotnum:

result.append(current+ [])

fori,vinenumerate(num):

current.append(num[i])

self.get_permute(current,num[:i]+num[i+1:],result)

current.pop()

if__name__=="__main__":

assertSolution().permute([1,2,3])== [[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]

[](https://www.python.org)

[](https://opensource.org/licenses/MIT)

This repository shares my experience in solving leetcode problems. I will update during half year. There are articles describing the solution. For further information, please see the[Articles](http://www.ranxiaolang.com/) part.

This repository shares my experience in solving leetcode problems. I will update during half year. There are articles describing the solution. For further information, please see the[Resource](http://www.ranxiaolang.com/) part.

All the problems on[LeetCode](https://leetcode.com).

I have update[gavinfish's](https://github.com/gavinfish) code and make the code more correctly.

[MIT LICENSE](./LICENSE)