704. 二分查找
python
class Solution:
def search(self, nums: List[int], target: int) -> int:
if not nums:
return -1
s=len(nums)
l=0
r=s-1
while l<=r:
m=(l+r)//2
if nums[m]==target:
return m
if nums[m]<target:
l=m+1
else:
r=m-1
return -1
java
class Solution {
public int search(int[] nums, int target) {
if(nums.length==0){
return -1;
}
int l=0;
int r=nums.length-1;
while(l<=r){
int m=(l+r)/2;
if(nums[m]==target){
return m;
}
if(nums[m]>target){
r=m-1;
}else{
l=m+1;
}
}
return -1;
}
}
27. 移除元素
python
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
if not nums:
return 0
l=0
for i in range(len(nums)):
if nums[i]!=val:
nums[l]=nums[i]
l+=1
return l
java
class Solution {
public int removeElement(int[] nums, int val) {
int l=0;
for(int i=0;i<nums.length;i++){
if(nums[i]!=val){
nums[l]=nums[i];
l++;
}
}
return l;
}
}
