Update

Update

Author: nature1995

Python3/046_Permutations.py

@@ -0,0 +1,33 @@
+#!usr/bin/env python3
+# -*- coding:utf-8 -*-
+'''
+Given a collection of distinct numbers, return all possible permutations.
+
+For example,
+[1,2,3] have the following permutations:
+[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].
+'''
+
+
+class Solution(object):
+    def permute(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[List[int]]
+        """
+        result = []
+        self.get_permute([], nums, result)
+        return result
+
+    def get_permute(self, current, num, result):
+        if not num:
+            result.append(current + [])
+            return
+        for i, v in enumerate(num):
+            current.append(num[i])
+            self.get_permute(current, num[:i] + num[i + 1:], result)
+            current.pop()
+
+
+if __name__ == "__main__":
+    assert Solution().permute([1, 2, 3]) == [[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]

README.md

@@ -3,16 +3,12 @@
 [![Language python](https://img.shields.io/badge/python-3.6-red.svg)](https://www.python.org)
 [![License](https://img.shields.io/dub/l/vibe-d.svg)](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.
 
 ## Problems
 
 All the problems on [LeetCode](https://leetcode.com).
 
-## Update
-
-I have update [gavinfish's](https://github.com/gavinfish) code and make the code more correctly.
-
 ## License
 
 [MIT LICENSE](./LICENSE)