Leetcode刷题Day1----数组

1. 数组理论基础

• 文章链接：https://programmercarl.com/%E6%95%B0%E7%BB%84%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.html

2. 二分法查找 https://leetcode.cn/problems/binary-search/ （Leetcode 704）

• 题目链接：https://leetcode.cn/problems/binary-search/
• 文章讲解：https://programmercarl.com/0704.%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.html
• 视频讲解：https://www.bilibili.com/video/BV1fA4y1o715

两种方法：左闭右闭 & 左闭右开

• 左闭右闭：【1，1】该数组成立
  right=长度-1；
  while(left<=right)
  更新left=mid+1;
  更新right=mid-1;

class Solution {public int search(int[] nums, int target) {int left=0;int right=nums.length-1;while(left<=right){int mid=(left+right)/2;if(nums[mid]>target) right=mid-1;else if(nums[mid]

class Solution {public int search(int[] nums, int target) {int left=0;int right=nums.length;while(leftint mid=(left+right)/2;if(nums[mid]>target) right=mid;else if(nums[mid]

class Solution {public int removeElement(int[] nums, int val) {int fast=0;int slow=0;while(fastif(nums[fast]!=val){nums[slow]=nums[fast];slow++;}fast++;}return slow;}
}