数据结构与算法之leetcode找规律题

面试题 01.08. 零矩阵

public class Solution {
    public void SetZeroes(int[][] matrix) {
// 1 0 1
        // 1 1 0
        // 2 2 2
        //创建 变量记录第一行 第一列是否有0存在
        bool firstRow = false;
        bool firstCol = false;
        int row = matrix.Length;
        int col = matrix[0].Length;
        for (int i = 0; i < col; i++)
        {
            if (matrix[0][i] == 0)
            {
                firstRow = true;
            }
        }
        for (int i = 0; i < row; i++)
        {
            if (matrix[i][0] == 0)
            {
                firstCol = true;
            }
        }

        // 将每行每列存在0  标记在第一行第一列
        for (int i = 1; i < row; i++)
        {
            for (int j = 1; j < col; j++)
            {
                if (matrix[i][j] == 0)
                {
                    matrix[i][0] = 0;
                    matrix[0][j] = 0;
                }
            }
        }
        //标记完成
        for (int i = 1; i < row; i++)
        {
            for (int j = 1; j < col; j++)
            {
                if (matrix[i][0] == 0 || matrix[0][j] == 0)
                {
                    matrix[i][j] = 0;
                }
            }
        }
        if (firstRow)
        {
            for (int i = 0; i < col; i++)
            {
                matrix[0][i] = 0;
            }
        }
        if (firstCol)
        {
            for (int i = 0; i < row; i++)
            {
                matrix[i][0] = 0;
            }
        }
    }
}

剑指 Offer 61. 扑克牌中的顺子

public class Solution {
    public bool IsStraight(int[] nums) {
        bool[] dup = new bool[14];
        int min = 100;
        int max = -1;
        for (int i = 0; i < 5; i++)
        {
            if (nums[i] != 0)
            {
                //判断是否有重复的
                if (dup[nums[i]])
                {
                    return false;
                }
                else
                {
                    dup[nums[i]] = true;
                }
                if (nums[i] < min)
                {
                    min = nums[i];
                }
                if (nums[i] > max)
                {
                    max = nums[i];
                }
            }
        }
        return (max - min) < 5;
    }
}

面试题 16.11. 跳水板

public class Solution {
    public int[] DivingBoard(int shorter, int longer, int k) {
        if (k == 0)
        {
            return new int[] {};
        }
        if (shorter == longer)
        {
            return new int[] { k * shorter };
        }
        int[] res = new int[k + 1];
        for (int i = 0; i < res.Length; i++)
        {
            res[i] = shorter * (k - i) + longer * i;
        }
        return res;
    }
}

面试题 01.05. 一次编辑

public class Solution {
    public bool OneEditAway(string first, string second) {

        if (Math.Abs(first.Length - second.Length) > 1)
        {
            return false;
        }
        int l1 = first.Length;
        int l2 = second.Length;
        int left1 = 0;
        int left2 = 0;
        while (left1 < l1 && left2 < l2 && first[left1] == second[left2])
        {
            left1++;
            left2++;
        }
        if (l1 == l2)
        {
            left1++;
            left2++;
        }
        else if (l1 < l2)
        {
            left2++;
        }
        else
        {
            left1++;
        }
        while (left1 < l1 && left2 < l2)
        {
            if (first[left1] != second[left2])
            {
                return false;
            }
            left1++;
            left2++;
        }
        return true;
    }
}

面试题 16.15. 珠玑妙算

public class Solution {
    public int[] MasterMind(string solution, string guess) {
        //R A G B  solution
        //R G G B  guess
        int length = solution.Length;
        bool[] hited = new bool[length];//guess已经击中猜中的
        bool[] used = new bool[length];//soluton中已经用掉的
        int hitNum = 0;
        for (int i = 0; i < length; i++)
        {
            if (solution[i] == guess[i])
            {
                hitNum++;
                hited[i] = true;
                used[i] = true;
            }
        }
        int fakeHitNum = 0;
        for (int i = 0; i < length; i++)
        {
            if (hited[i])
            {
                continue;
            }
            //把每个guess中的数放在solution中便利
            for (int j = 0; j < length; j++)
            {
                if (guess[i] == solution[j] && !used[j])
                {
                    used[j] = true;
                    fakeHitNum++;
                    break;
                }
            }
        }
        return new int[] { hitNum, fakeHitNum };
    }
}

面试题 16.04. 井字游戏

55. 跳跃游戏

public class Solution {
    public bool CanJump(int[] nums) {
        int maxCanJumpIndex = 0;
        for (int i = 0; i < nums.Length; i++)
        {
            if (i > maxCanJumpIndex)
            {
                return false;
            }
            if ((i + nums[i]) > maxCanJumpIndex)
            {
                maxCanJumpIndex = (nums[i] + i);

            }
            if (maxCanJumpIndex >= (nums.Length - 1))
            {
                return true;
            }
        }
        return false;
    }
}

48. 旋转图像

public class Solution {
    public void Rotate(int[][] matrix) {
        int n = matrix.Length;
        //先水平上下翻转再对角线旋转
        for (int i = 0; i < n / 2; i++)
        {
            for (int j = 0; j < n; j++)
            {
                int tmp = matrix[i][j];
                matrix[i][j] = matrix[n - i - 1][j];
                matrix[n - i - 1][j] = tmp;
            }
        }
        //再对角线翻转
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < i; j++)
            {
                int tmp = matrix[i][j];
                matrix[i][j] = matrix[j][i];
                matrix[j][i] = tmp;
            }
        }

    }
}

54. 螺旋矩阵

public class Solution {
    public IList<int> SpiralOrder(int[][] matrix) {
        //螺旋矩阵
        int top = 0;
        int bottom = matrix.Length - 1;
        int left = 0;
        int right = matrix[0].Length - 1;
        List<int> res = new List<int>();
        while (left <= right && top <= bottom)
        {
            //第一上行
            for (int i = left; i <= right; i++)
            {
                res.Add(matrix[top][i]);
            }
            //第一右列
            for (int i = top + 1; i <= bottom; i++)
            {
                res.Add(matrix[i][right]);
            }
            if (left < right && top < bottom)
            {
                //第一下行
                for (int i = right - 1; i > left; i--)
                {
                    res.Add(matrix[bottom][i]);
                }
                //第一左列
                for (int i = bottom; i > top; i--)
                {
                    res.Add(matrix[i][left]);
                }
            }
            left++;
            right--;
            top++;
            bottom--;
        }
        return res;
    }
}

240. 搜索二维矩阵 II （中等）经典

public class Solution {

    public bool SearchMatrix(int[][] matrix, int target)
    {
        int h = matrix.Length;
        int w = matrix[0].Length;
        int i = 0;
        int j = w - 1;
        //根据matrix[i][j] 跟target的大小关系，一层一层的剥离
        while (i <= h - 1 && j >= 0)
        {
            if (matrix[i][j] == target)
            {
                return true;
            }
            if (matrix[i][j] > target)
            {
                j--;
                continue;
            }
            if (matrix[i][j] < target)
            {
                i++;
                continue;
            }
        }
        return false;

    }
}