1.     /**
    2.      * 35. 搜索插入位置 -> 二分查询
    3.      *
    4.      * @param nums
    5.      * @param target
    6.      * @return
    7.      */
    8.     public static int searchInsert(int[] nums, int target) {
    9.         for (int i = 0; i < nums.length; i++) {
    10.             if (nums[i] == target) {
    11.                 return i;
    12.             } else if (nums[i] >= target) {
    13.                 return i;
    14.             }
    16.             if (i == nums.length - 1 && target > nums[i]) {
    17.                 return nums.length;
    18.             }
    19.         }
    20.         return 0;
    21.     }
    23.     /**
    24.      * 二分查找
    25.      *
    26.      * @param nums
    27.      * @param target
    28.      * @return
    29.      */
    30.     public static int searchInsertInGF(int[] nums, int target) {
    31.         int n = nums.length;
    32.         int left = 0, right = n - 1, ans = n;
    33.         while (left <= right) {
    34.             int mid = ((right - left) >> 1) + left;
    35.             if (target <= nums[mid]) {
    36.                 ans = mid;
    37.                 right = mid - 1;
    38.             } else {
    39.                 left = mid + 1;
    40.             }
    41.         }
    42.         return ans;
    43.     }
    45.     /**
    46.      * 28. 实现 strStr() 函数
    47.      * <p>
    48.      * 来源：力扣（LeetCode）
    49.      * 链接：https://leetcode-cn.com/problems/implement-strstr
    50.      * 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
    51.      *
    52.      * @param haystack
    53.      * @param needle
    54.      * @return
    55.      */
    56.     public static int strStr(String haystack, String needle) {
    57.         if (null == needle || 0 == needle.length()) {
    58.             return 0;
    59.         }
    60.         return haystack.indexOf(needle);
    61.     }
    63.     /**
    64.      * 27. 移除元素
    65.      *
    66.      * @param nums
    67.      * @param val
    68.      * @return
    69.      */
    70.     public static int removeElement(int[] nums, int val) {
    71.         int slow = 0;
    72.         for (int i = 0; i < nums.length; i++) {
    73.             if (nums[i] != val) {
    74.                 nums[slow++] = nums[i];
    75.             }
    76.         }
    77.         return slow;
    78.     }
    81.     /**
    82.      * 26. 删除有序数组中的重复项
    83.      *
    84.      * @param nums
    85.      * @return
    86.      */
    87.     public static int removeDuplicates(int[] nums) {
    88.         if (nums.length == 0 || nums.length == 1) {
    89.             return nums.length;
    90.         }
    91.         int slow = 0;
    92.         for (int i = 0; i < nums.length; i++) {
    93.             if (i != 0 && nums[i] != nums[slow]) {
    94.                 nums[++slow] = nums[i];
    95.             }
    96.         }
    97.         return slow + 1;
    98.     }