10.9

Author: huangyt39

159.py

@@ -0,0 +1,24 @@
+class Solution:
+    """
+    @param nums: a rotated sorted array
+    @return: the minimum number in the array
+    """
+    def findMin(self, nums):
+        # write your code here
+        if len(nums) == 0:
+            return None
+        if len(nums) == 1:
+            return nums[0]
+        left = 0
+        right = len(nums) - 1
+        while right - left > 1:
+            if nums[left] < nums[right]:
+                return nums[left]
+            mid = (left + right) // 2
+            if nums[mid] > nums[left]:
+                left = mid
+            else:
+                right = mid
+        return min(nums[right], nums[left])
+
+print(Solution.findMin(1, [4,5,6,7,0,1,2]))

365.py

@@ -0,0 +1,17 @@
+class Solution:
+    """
+    @param: num: An integer
+    @return: An integer
+    """
+    def countOnes(self, num):
+        # write your code here
+        count = 0
+        if num >= 0:
+            while num != 0:
+                count += num%2
+                num = num >> 1 
+            return count
+        else:
+            return Solution.countOnes(1, 2**32 + num)
+
+print(Solution.countOnes(1, -178))

38.py

@@ -0,0 +1,33 @@
+class Solution:
+    """
+    @param matrix: A list of lists of integers
+    @param target: An integer you want to search in matrix
+    @return: An integer indicate the total occurrence of target in the given matrix
+    """
+    def searchMatrix(self, matrix, target):
+        # write your code here
+        if len(matrix) == 0:
+            return 0
+        if len(matrix[0]) == 0:
+            return 0
+        res = 0
+        n, m = len(matrix[0]), len(matrix)
+        x, y = 0, 0
+        while x != n and y != m:
+            if matrix[y][x] == target:
+                res += 1
+            for i in range(x + 1, n):
+                if matrix[y][i] == target:
+                    res += 1
+                    break
+            for j in range(y + 1, m):
+                if matrix[j][x] == target:
+                    res += 1
+                    break
+            x += 1
+            y += 1
+        return res
+
+# print(Solution.searchMatrix(1, [[1,3,5,7],[2,4,7,8],[3,5,9,10]], 3))
+print(Solution.searchMatrix(1, [[3,4]], 3))
+print(Solution.searchMatrix(1, [[1,3,5,7],[3,11,16,20],[23,30,34,50]], 3))