Leetcode——新增的最少台阶数

1. 题目

2. 题解

• 注意规避台阶差 与 dist 余0时的特殊情况
• 注意规避第一个台阶大于dist的特殊情况

class Solution {
    public int addRungs(int[] rungs, int dist) {
        int len = rungs.length;
        int res = 0;
        if(rungs == null || len == 0)
            return 0;
        
        //判断-1 到 0台阶，余0时结果会不一样，需减去一个dist
        if (rungs[0] > dist && len >= 1 && rungs[0] % dist == 0) {        
            res = (rungs[0] - dist) / dist;
        }

        else if (rungs[0] > dist && len >= 1) {
            res = rungs[0] / dist;
        }
        
        //判断后续台阶，余0时结果会不一样，需减去一个dist
        for (int i = 1; i < len; i++) {
            if (rungs[i] - rungs[i - 1] > dist && (rungs[i] - rungs[i - 1]) % dist == 0) {
	             //余0时结果会不一样，需减去一个dist
                res = res + (rungs[i] - rungs[i - 1] - dist) / dist;
            }
            else if (rungs[i] - rungs[i - 1] > dist) {
                res = res + (rungs[i] - rungs[i - 1]) / dist;
            }
        }
        return res;
    }
}

简化代码：

• 两个台阶之间如果大于dist,就查看两台阶之间最少插入多少个台阶，
• 需要插入的台阶 = (rungs[i] - rungs[i - 1] - 1) / 2;

class Solution {
    public int addRungs(int[] rungs, int dist) {
        int len = rungs.length;
        int res = 0;
        if(rungs == null || len == 0)
            return 0;
        
        //判断-1 到 0台阶， 注意需要 -1， 举个例子：[3]，1，只需要增加两个台阶
        if (rungs[0] > dist) 
            res = (rungs[0] - 1) / dist;

        //判断后续台阶
        for (int i = 1; i < len; i++) {
            if (rungs[i] - rungs[i - 1] > dist) {
                res += (rungs[i] - rungs[i - 1] - 1) / dist; 
            }
        }

        return res;
    }
}