[leetcode]初级算法——排序和搜索

合并两个有序数组

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

• The number of elements initialized in nums1 and nums2 are m and n respectively.
• You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

Example:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6],       n = 3

Output: [1,2,2,3,5,6]

Code(By myself):

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.
        """
        p = 0
        q = 0
        while p < m + q and q < n:
            if  nums1[p] < nums2[q]:
                p += 1
            else:
                nums1[p+1:] = nums1[p:m+n-1]
                nums1[p] = nums2[q]
                p += 1
                q += 1
        if q < n:
            nums1[p:] = nums2[q:]

总结:

递归求解

第一个错误的版本

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.

Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad.

You are given an API bool isBadVersion(version) which will return whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

Example:

Given n = 5, and version = 4 is the first bad version.

call isBadVersion(3) -> false
call isBadVersion(5) -> true
call isBadVersion(4) -> true

Then 4 is the first bad version. 

Code(By myself):

# The isBadVersion API is already defined for you.
# @param version, an integer
# @return a bool
# def isBadVersion(version):

class Solution(object):
    def firstBadVersion(self, n):
        """
        :type n: int
        :rtype: int
        """
        return self.BadVersion(0,n)
    
    def BadVersion(self, first, second):
        mid = (first + second) // 2
        if first == second:
            return first
        if isBadVersion(mid):
            BadVersion = self.BadVersion(first,mid)
        else:
            BadVersion = self.BadVersion(mid+1,second)
        return BadVersion

Code(others):

class Solution(object):
    def firstBadVersion(self, n):
        """
        :type n: int
        :rtype: int
        """
        left,right = 1,n
        while left<right:
            mid=(left+right)>>1
            if isBadVersion(mid):
                right=mid
            else:
                left=mid+1
        return left

总结:

想法过于复杂，没必要递归