2.28

Author: DmrfCoder

README.md

@@ -60,4 +60,13 @@
 
 - [把数组排成最小的数](./SwordToOffer/Doc/把数组排成最小的数.md)
 
+- [整数中1出现的次数](./SwordToOffer/Doc/整数中1出现的次数.md)
+
+- [***丑数***](./SwordToOffer/Doc/丑数.md)
+
+- [第一次只出现一次的字符](./SwordToOffer/Doc/第一次只出现一次的字符.md)
+
+- [数组中的逆序对](./SwordToOffer/Doc/数组中的逆序对.md)
+
 
+

SwordToOffer/Code/25.py

@@ -1,10 +1,87 @@
 # -*- coding:utf-8 -*-
-# class TreeNode:
-#     def __init__(self, x):
-#         self.val = x
-#         self.left = None
-#         self.right = None
+class TreeNode:
+    def __init__(self, x):
+        self.val = x
+        self.left = None
+        self.right = None
+
+
 class Solution:
     def Convert(self, pRootOfTree):
         # write code here
-        pass
+        stack = []
+        p = pRootOfTree
+        a = []
+        pre = None
+        next = None
+        preP = None
+        head = None
+
+        while len(stack) != 0 or p is not None:
+            if p is not None:
+                stack.append(p)
+                p = p.left
+            else:
+                p = stack[-1]
+                del stack[-1]
+                if head is None:
+                    head = p
+                # a.append(p.val)
+                p.left = preP
+
+                if preP is not None:
+                    preP.right = p
+                preP = p
+
+                p = p.right
+
+        return head
+
+
+def MidPrint(root):
+    stack = []
+    p = root
+    a = []
+    pre = None
+    next = None
+    preP = None
+    head = None
+
+    while len(stack) != 0 or p is not None:
+        if p is not None:
+            stack.append(p)
+            p = p.left
+        else:
+            p = stack[-1]
+            del stack[-1]
+            if head is None:
+                head = p
+            # a.append(p.val)
+            p.left = preP
+
+            if preP is not None:
+                preP.right = p
+            preP = p
+
+            p = p.right
+
+    return head
+
+
+pRoot1 = TreeNode(1)
+treeNode2 = TreeNode(2)
+treeNode3 = TreeNode(3)
+treeNode4 = TreeNode(4)
+treeNode5 = TreeNode(5)
+treeNode6 = TreeNode(6)
+treeNode7 = TreeNode(7)
+
+pRoot1.left = treeNode2
+pRoot1.right = treeNode3
+treeNode2.left = treeNode4
+treeNode2.right = treeNode5
+treeNode3.left = treeNode6
+treeNode3.right = treeNode7
+s = Solution()
+head = MidPrint(pRoot1)
+a = 1

SwordToOffer/Code/26.py

@@ -1,12 +1,37 @@
 # -*- coding:utf-8 -*-
 class Solution:
+
+    def swap(self, arr, one, two):
+        arr = list(arr)
+        t = arr[one]
+        arr[one] = arr[two]
+        arr[two] = t
+        return ''.join(arr)
+
     def Permutation(self, ss):
         # write code here
-        if len(ss)==1:
-            return ss
-
+        if ss is None:
+            return []
+        if len(ss)==0:
+            return []
+        if len(ss) == 1:
+            return [ss]
+        size = len(ss)
         t = self.Permutation(ss[1:])
+        arr = []
+        for i in range(len(t)):
+            t[i] = ss[0] + t[i]
+            arr.append(t[i])
+            for j in range(1, size):
+                if t[i][0]==t[i][j]:
+                    continue
+                arr.append(self.swap(t[i], 0, j))
+        return arr
+
+    def Permutation2(self,ss):
+        intSs=[]
+
 
 
 s = Solution()
-s.Permutation('abcd')
+print s.Permutation('aab')

SwordToOffer/Code/30.py

@@ -1,36 +1,35 @@
 # -*- coding:utf-8 -*-
 class Solution:
-
-    def PrintMinNumber(self, numbers):
+    def NumberOf1Between1AndN_Solution(self, n):
         # write code here
-        if numbers is None:
-            return ""
-        if len(numbers)==0:
-            return ""
-        strs = []
-        for item in numbers:
-            strs.append(str(item))
-
-        z = sorted(strs, cmp)
-
-        r=''
-
-        for item in z:
-            r=r+item
-
-
-        return int(r)
-
-
-def cmp(str1, str2):
-    s1 = str1 + str2
-    s2 = str2 + str1
-
-    if int(s1) < int(s2):
-        return -1
-    else:
-        return 0
+        strN = str(n)
+        size = len(strN)
+        sum = 0
+
+        # 从个位开始
+        for i in range(size - 1, -1, -1):
+            curBit = int(strN[i])
+            multiValue = pow(10, size - 1 - i)
+            if i == 0:
+                biggerValue = 0
+            else:
+                biggerValue = strN[0:i]
+            if i == size - 1:
+                smallerValue = 0
+            else:
+                smallerValue = strN[i + 1:]
+
+            if curBit == 1:
+                count = int(biggerValue) * multiValue + int(smallerValue) + 1
+            elif curBit == 0:
+                count = int(biggerValue) * multiValue
+            else:
+                count = (int(biggerValue) + 1) * multiValue
+
+            sum += count
+
+        return sum
 
 
 s = Solution()
-print s.PrintMinNumber([3,32,321])
+print s.NumberOf1Between1AndN_Solution(13)

SwordToOffer/Code/31.py

@@ -0,0 +1,36 @@
+# -*- coding:utf-8 -*-
+
+def cmp(str1, str2):
+    s1 = str1 + str2
+    s2 = str2 + str1
+    if int(s1) < int(s2):
+        return -1
+    else:
+        return 0
+
+
+class Solution:
+
+    def PrintMinNumber(self, numbers):
+        # write code here
+        if numbers is None:
+            return ""
+        if len(numbers) == 0:
+            return ""
+
+        strs = []
+        for item in numbers:
+            strs.append(str(item))
+
+        strs.sort(cmp)
+        print strs
+
+        r = ''
+        for item in strs:
+            r = r + item
+
+        return int(r)
+
+
+s = Solution()
+print s.PrintMinNumber([3, 5, 1, 4, 2])

SwordToOffer/Code/32.py

@@ -0,0 +1,28 @@
+# -*- coding:utf-8 -*-
+class Solution:
+    def GetUglyNumber_Solution(self, index):
+        # write code here
+        if index==0:
+            return 0
+
+        t2Index = 0
+        t3Index = 0
+        t5Index = 0
+
+        res = [1]
+
+        for i in range(0, index - 1):
+            minValue = min(res[t2Index] * 2, min(res[t3Index] * 3, res[t5Index] * 5))
+            res.append(minValue)
+            if minValue == res[t2Index] * 2:
+                t2Index += 1
+            if minValue == res[t3Index] * 3:
+                t3Index += 1
+            if minValue == res[t5Index] * 5:
+                t5Index += 1
+
+        return res[-1]
+
+
+s = Solution()
+print s.GetUglyNumber_Solution(7)

SwordToOffer/Code/33.py

@@ -0,0 +1,30 @@
+# -*- coding:utf-8 -*-
+class Solution:
+    def FirstNotRepeatingChar(self, s):
+        # write code here
+        size = len(s)
+        #存储不同字符
+        array1 = []
+        #存储不同字符对应的出现次数
+        array2 = []
+        #存储不同字符第一次出现的下标
+        array3=[]
+
+
+        for i in range(size):
+            if s[i] not in array1:
+                array1.append(s[i])
+                array2.append(1)
+                array3.append(i)
+            else:
+                index = array1.index(s[i])
+                array2[index] += 1
+
+        for i in range(len(array2)):
+            if array2[i] == 1:
+                return array3[i]
+
+        return -1
+
+s=Solution()
+print s.FirstNotRepeatingChar('aabbccd')

SwordToOffer/Code/34.py

@@ -0,0 +1,40 @@
+# -*- coding:utf-8 -*-
+def cmp(a, b):
+    if a < b:
+        return 0
+    else:
+        return -1
+
+
+class Solution:
+
+    def InversePairs(self, data):
+        # write code here
+        size = len(data)
+        count = 0
+        for i in range(size - 1, -1, -1):
+            for j in range(i - 1, -1, -1):
+                if data[i] < data[j]:
+                    count += 1
+
+        return count % 1000000007
+
+
+def GuiBingSort(data):
+    size = len(data)
+    if size == 2:
+        if data[0] < data[1]:
+            return data
+        else:
+            return [data[1], data[0]]
+
+    if size==0:
+        return data
+
+    index=int(size/2)
+    return GuiBingSort(data[0:index])+GuiBingSort(data[index:])
+
+
+s = Solution()
+#print s.InversePairs([1, 2, 3, 4, 5, 6, 7, 0])
+print GuiBingSort([1, 2, 3, 4, 5, 6, 7, 0])