Merge branch 'master' of https://github.com/KuiyuanFu/VSCodeExtensionPythonLeetcode

Author: KuiyuanFu

.gitignore

@@ -64,3 +64,4 @@ out
 
 # Mac
 .DS_Store
+package-lock.json

VSCodeExtensionPythonLeetcode.md

@@ -11,8 +11,7 @@
 ### 安装
 
 ````shell
-npm install -g yo generator-code
-npm install -g typescript
+npm install -g yo generator-code typescript  vsce
 npm install
 ````
 

package-lock.json

@@ -2,7 +2,7 @@
     "name": "python-leetcode",
     "displayName": "PythonLeetcode",
     "description": "Solve LeetCode problems in VS Code",
-    "version": "1.0.0",
+    "version": "1.0.1",
     "author": "KuiyuanFu",
     "publisher": "KuiyuanFu",
     "license": "MIT",

package.json

@@ -19,6 +19,16 @@ def __repr__(self):
         return self.__str__()
 
 
+def listToListNode(l: List[int]) -> ListNode:
+    ''' List[int] to ListNode '''
+    pseudo = ListNode()
+    p = pseudo
+    for i in l:
+        p.next = ListNode(i)
+        p = p.next
+    return pseudo.next
+
+
 class TreeNode:
     def __init__(self, val=0, left=None, right=None):
         self.val = val
@@ -37,28 +47,22 @@ def __str__(self):
                 q.put(node.left)
                 s.append(node.left.val)
             else:
-                s.append('None')
+                s.append(None)
             if node.right:
                 q.put(node.right)
                 s.append(node.right.val)
             else:
-                s.append('None')
+                s.append(None)
+
+        while len(s) > 0 and s[-1] == None:
+            s.pop()
+
         return str(s)
 
     def __repr__(self):
         return self.__str__()
 
 
-def listToListNode(l: List[int]) -> ListNode:
-    ''' List[int] to ListNode '''
-    pseudo = ListNode()
-    p = pseudo
-    for i in l:
-        p.next = ListNode(i)
-        p = p.next
-    return pseudo.next
-
-
 def listToTreeNode(l: List[int]) -> TreeNode:
     ''' List[int] to TreeNode '''
     if len(l) == 0: