【LeetCode】35、69

最新推荐文章于 2022-08-23 21:55:55 发布

July twelve

最新推荐文章于 2022-08-23 21:55:55 发布

阅读量250

点赞数

分类专栏： leetcode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/yys190418/article/details/125836070

版权

leetcode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

搜索插入位置

ts

function searchInsert(nums: number[], target: number): number {
  for (let i1 = 0; i1 < nums.length; i1++) {
    if (nums[i1] >= target) return i1
  }
  return nums.length
}

java

class Solution {
    public int searchInsert(int[] nums, int target) {
        for(int i = 0;i < nums.length; i++){
            if (nums[i] >= target) {
                return i;
            }
        }
        return nums.length;
    }
}

py

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        for i, v in enumerate(nums):
            if(v>=target):
                return i
        return len(nums)

C#

public class Solution {
    public int SearchInsert(int[] nums, int target) {
        for(int i = 0;i < nums.Length;i++){
            if(nums[i]>=target){
                return i;
            }
        }
        return nums.Length;
    }
}

x 的平方根

ts

function mySqrt(x: number): number {
    if (x === 0) return 0
    if (x < 4) return 1
    let min: number = 0, max: number = x
    while (max - min > 1) {
        let num: number = Math.floor((max + min) / 2)
        if ((x / num) < num) {
            max = num
        } else {
            min = num
        }
    }
    return min
};

java

class Solution {
    public int mySqrt(int x) {
        if(x==0){
            return 0;
        }
        if(x<4){
            return 1;
        }
        int min = 0;
        int max = x;
        while(max - min > 1){
            int num = (max+min)/2;
            if((x/num)<num){
                max = num;
            }else{
                min = num;
            }
        }
        return min;
    }
}

python

class Solution:
    def mySqrt(self, x: int) -> int:
        if(x == 0):
            return 0
        if(x<4):
            return 1
        min = 0
        max = x
        while(max - min>1):
            num = math.floor((max+min)/2)
            if((x/num)<num):
                max = num
            else:
                min = num
        return min

C#

public class Solution {
    public int MySqrt(int x) {
        if(x == 0){
            return 0;
        }
        if(x<4){
            return 1;
        }
        int min = 0;
        int max = x;
        while(max-min>1){
            int num = (max+min)/2;
            if((x/num)<num){
                max = num;
            }else{
                min = num;
            }
        }
        return min;
    }
}