JS|704-二分查找、27-移除元素

Leecode 704 二分查找

题目链接 力扣https://leetcode.cn/problems/binary-search/

1.左闭右闭

var search = function(nums, target) {
  let left = 0
  let right = nums.length-1
  while(left <= right){
    //位运算，相当于(left+right)/2，在JS中不会主动取整
    //位运算这里是向下取整了
    //位运算可以防止大数溢出
      mid = left + ((right-left)>>1)
      if(target < nums[mid]){
        right = mid -1
      }else if(target > nums[mid]){
          left = mid +1
      }else{
          return mid
      }
  }
  return -1
};

2.左闭右开

var search = function(nums, target) {
  let left = 0
  let right = nums.length
  while(left < right){
    //位运算，相当于(left+right)/2，在JS中不会主动取整
    //位运算这里是向下取整了
    //位运算可以防止大数溢出
      mid = left + ((right-left)>>1)
      if(target < nums[mid]){
        right = mid
      }else if(target > nums[mid]){
          left = mid +1
      }else{
          return mid
      }
  }
  return -1
};

Leecode 27 移除元素

题目链接 

力扣https://leetcode.cn/problems/remove-element/

1.暴力求解

var removeElement = function(nums, val) {
  let len = nums.length
  //遍历整个数组
    for(let i=0; i<len; i++){
       if(nums[i] == val){    
          for(let j=i+1; j<len; j++){
            //把val之后的数依次往前挪一位
            nums[j-1] = nums[j]
          }
          len--
          //因为val后面的数已经往前挪了一位，i值也要往前挪一位
          i--
       }
    }
    return len
};

2.双指针

var removeElement = function(nums, val) {
  //k是慢指针，i是快指针
  //快指针，新数组的元素
  //慢指针，数组下标
   let k=0
   for(let i=0; i<nums.length; i++){
    if(nums[i] !== val){
      nums[k++] = nums[i]
    }
   }
   return k
};