jiaxinhuang
diff --git a/‎leetcode/MergeSortedArray.py
Lines changed: 33 additions & 0 deletions b/‎leetcode/MergeSortedArray.py
Lines changed: 33 additions & 0 deletions
diff --git a/‎leetcode/RemoveDuplicatesfromSortedList.py
Lines changed: 25 additions & 0 deletions b/‎leetcode/RemoveDuplicatesfromSortedList.py
Lines changed: 25 additions & 0 deletions
diff --git a/‎leetcode/SameTree.py
Lines changed: 29 additions & 0 deletions b/‎leetcode/SameTree.py
Lines changed: 29 additions & 0 deletions
@@ -0,0 +1,33 @@
+#-*- coding:utf-8 -*-
+'''
+Created on 2017年4月24日
+
+@author: huangjiaxin
+'''
+class Solution(object):
+    def merge(self, nums1, m, nums2, n):
+        """
+        :type nums1: List[int]
+        :type m: int
+        :type nums2: List[int]
+        :type n: int
+        :rtype: void Do not return anything, modify nums1 in-place instead.
+        """
+        if m == 0:
+            nums1[:n] = nums2[:n]
+        else:
+            while m > 0 and n > 0:
+                if nums1[m-1] >= nums2[n-1]:
+                    nums1[m + n -1] = nums1[m-1]
+                    m -= 1
+                else:
+                    nums1[m + n -1] = nums2[n - 1]
+                    n -= 1 
+        if n > 0:
+            nums1[:n] = nums2[:n]
+
+if __name__ == '__main__':
+    a = [2,0]
+    b = [1]
+    Solution().merge(a, 1, b, 1)
+    print a
@@ -0,0 +1,25 @@
+#-*- coding:utf-8 -*-
+'''
+Created on 2017年4月21日
+
+@author: huangjiaxin
+'''
+# Definition for singly-linked list.
+class ListNode(object):
+    def __init__(self, x):
+        self.val = x
+        self.next = None
+
+class Solution(object):
+    def deleteDuplicates(self, head):
+        """
+        :type head: ListNode
+        :rtype: ListNode
+        """
+        temp = head
+        while temp and temp.next:
+            if temp.val == temp.next.val:
+                temp.next = temp.next.next
+            else:
+                temp = temp.next
+        return head
@@ -0,0 +1,29 @@
+#-*- coding:utf-8 -*-
+'''
+Created on 2017年4月24日
+
+@author: huangjiaxin
+'''
+# Definition for a binary tree node.
+class TreeNode(object):
+    def __init__(self, x):
+        self.left = None
+        self.right = None
+
+class Solution(object):
+    def isSameTree(self, p, q):
+        """
+        :type p: TreeNode
+        :type q: TreeNode
+        :rtype: bool
+        """
+        if (p == None and q != None) or (p != None and q == None):
+            return False
+        elif p == None and q == None:
+            return True
+        else:
+            if p.val == q.val:
+                return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
+            else:
+                return False