2022-06-25

[SaraadKun]

剑指 Offer II 091. 粉刷房子

class Solution {
    public int minCost(int[][] costs) {
        int n  = costs.length;
        //状态压缩
        int a = 0, b = 0, c = 0;
        for (int i = 0; i < n; i++) {
            int aa = Math.min(b, c) + costs[i][0];
            int bb = Math.min(a, c) + costs[i][1];
            int cc = Math.min(a, b) + costs[i][2];
            a = aa; b = bb; c = cc;
        }
        return Math.min(Math.min(a, b), c);
    }
}

---

WeChat: Saraad

[SaraadKun]

665. Non-decreasing Array

class Solution {
    public boolean checkPossibility(int[] nums) {
        int cnt = 0, n = nums.length;
        for (int i = 0; i < n - 1; i++) {
            if (nums[i] > nums[i + 1]) {
                cnt++;    
                if (cnt > 1)
                    return false;
                if (i > 0 && nums[i - 1] > nums[i + 1])
                    nums[i + 1] = nums[i];
            }
        }
        return true;
    }
}

---

WeChat: Saraad