Sorting and searching

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        nums1[m:] = nums2
        nums1.sort()

class Solution:
    def merge(self,nums1:List[int],m:int,nums2:List[int],n:int) ->None
        nums1[m:] = nums2
        nums1.sort()

Dichotomy search

class Solution:
    def firstBadVersion(self, n: int) -> int:
        i, j = 1, n
        while i <= j:
            #  Calculate the midpoint by rounding down and dividing  m 
            m = (i + j) // 2
            #  if  m  Is the wrong version , Then the last correct version must be in the closed interval  [i, m - 1]
            if isBadVersion(m): j = m - 1
            #  if  m  Is the correct version , Then the first wrong version must be in the closed interval  [m + 1, j]
            else: i = m + 1
        # i  Point to the first wrong version ,j  Point to the last correct version 
        return i

class Solution:
    def firstBadVersion(self,n:int) -> int:
        i,j =1,n
        while i<= j:
            # Calculate the midpoint by rounding down and dividing m
            m =(i+j)//2
            # if m Is the wrong version , Then the last correct version must be 
            if isBadVersion(m): j=m-1
            else: i =m+1
        return i

class Solution:
    def firstBadVersion(self,n:int) -> int:
        i,j =1,n
        while i<=j:
            m= (i+j)//2
            if isBadVersion(m): j=m-1
            else: i=m+1
        return i