【LeetCode】74、75

最新推荐文章于 2024-07-22 16:27:42 发布

July twelve

最新推荐文章于 2024-07-22 16:27:42 发布

阅读量236

点赞数

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

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

版权

leetcode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

搜索二维矩阵

ts

function searchMatrix(matrix: number[][], target: number): boolean {
    let len1 = matrix.length
    let len2 = matrix[0].length
    for (let i = 0; i < len1; i++) {
        if (target >= matrix[i][0]) {
            if (target <= matrix[i][len2 - 1]) {
                for (let i2 = 0; i2 < len2; i2++) {
                    if (target === matrix[i][i2]) {
                        return true
                    }
                }
                return false
            }
        }
    }
    return false
}

python

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        m = len(matrix)
        n = len(matrix[0])
        for i1 in range(m):
            if target >= matrix[i1][0]:
                if target <= matrix[i1][-1]:
                    for i2 in range(n):
                        if target == matrix[i1][i2]:
                            return True
                    return False
        return False

C#

public class Solution {
    public bool SearchMatrix(int[][] matrix, int target) {
        int m = matrix.Length;
        int n = matrix[0].Length;
        for(int i1 =0;i1<m;i1++){
            if(target>=matrix[i1][0] && target<=matrix[i1][n-1]){
                for(int i2 =0;i2<n;i2++){
                    if(target == matrix[i1][i2]){
                        return true;
                    }
                }
                return false;
            }
        }
        return false;
    }
}

颜色分类

ts

/**
 Do not return anything, modify nums in-place instead.
 */
function sortColors(nums: number[]): void {
    for (let i1 = 0; i1 < nums.length; i1++) {
        for (let i2 = i1 + 1; i2 < nums.length; i2++) {
            if (nums[i1] > nums[i2]) {
                const _tem = nums[i1]
                nums[i1] = nums[i2]
                nums[i2] = _tem
            }
        }
    }
};

python

class Solution:
    def sortColors(self, nums: List[int]) -> None:
        for i1 in range(len(nums)):
            for i2 in range(i1+1,len(nums)):
                if(nums[i1]>nums[i2]):
                    nums[i1],nums[i2] = nums[i2],nums[i1]

C#

public class Solution {
    public void SortColors(int[] nums) {
        for(int i1 =0;i1<nums.Length;i1++){
            for(int i2= i1+1;i2<nums.Length;i2++){
                if(nums[i1]>nums[i2]){
                    int i = nums[i1];
                    nums[i1] = nums[i2];
                    nums[i2] = i;
                }
            }
        }
    }
}