Latest Updates

LeetCode/problems/1030-matrix-cells-in-distance-order/1030-matrix-cells-in-distance-order.js

/**
 * @param {number} rows
 * @param {number} cols
 * @param {number} rCenter
 * @param {number} cCenter
 * @return {number[][]}
 */
var allCellsDistOrder = function(rows, cols, rCenter, cCenter) {
    let arr = [];
    for(let A = 0; A<rows; A++){
        for(let B = 0; B<cols; B++){
            let dist = Math.abs(A-rCenter) + Math.abs(B-cCenter);
            if( arr[dist] == undefined){
                arr[dist] = [];
            }
            arr[dist].push([A,B]);
        }
    }
    return [...arr].flat();
};

LeetCode/problems/1266-minimum-time-visiting-all-points/1266-minimum-time-visiting-all-points.js

/**
 * @param {number[][]} points
 * @return {number}
 */
var minTimeToVisitAllPoints = function(points) {
    let ans = 0;
    for(let I = 1; I<points.length; I++){
        let A =  Math.abs( points[I][0] - points[I-1][0] );
        let B = Math.abs( points[I][1] - points[I-1][1] );
        ans += Math.max(A,B);
    }
    return ans;
};