mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
@ -561,5 +561,51 @@ class Solution {
|
||||
}
|
||||
```
|
||||
|
||||
**C#:**
|
||||
```csharp
|
||||
//左闭右闭
|
||||
public class Solution {
|
||||
public int Search(int[] nums, int target) {
|
||||
int left = 0;
|
||||
int right = nums.Length - 1;
|
||||
while(left <= right){
|
||||
int mid = (right - left ) / 2 + left;
|
||||
if(nums[mid] == target){
|
||||
return mid;
|
||||
}
|
||||
else if(nums[mid] < target){
|
||||
left = mid+1;
|
||||
}
|
||||
else if(nums[mid] > target){
|
||||
right = mid-1;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
//左闭右开
|
||||
public class Solution{
|
||||
public int Search(int[] nums, int target){
|
||||
int left = 0;
|
||||
int right = nums.Length;
|
||||
while(left < right){
|
||||
int mid = (right - left) / 2 + left;
|
||||
if(nums[mid] == target){
|
||||
return mid;
|
||||
}
|
||||
else if(nums[mid] < target){
|
||||
left = mid + 1;
|
||||
}
|
||||
else if(nums[mid] > target){
|
||||
right = mid;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
|
||||
-----------------------
|
||||
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
|
||||
|
Reference in New Issue
Block a user