[Refresh ! 코딩 테스트 / js]-64. Minimum Path Sum && 452. Minimum Number of Arrows to Burst Balloons

Minimum Path Sum

var minPathSum = function(grid) {
    let dp = Array.from({ length: grid.length }, () => new Array(grid[0].length).fill(0));
    
    for (let i = 0; i < grid.length; i++) {
        for (let z = 0; z < grid[0].length; z++) {
            if (i === 0 && z === 0) {
                dp[i][z] = grid[i][z];
                
            }
            if (i === 0) {
                dp[i][z] = dp[i][z - 1] + grid[i][z];
                
            }
            if (z === 0) {
                dp[i][z] = dp[i - 1][z] + grid[i][z];
                
            }
            dp[i][z] = grid[i][z] + Math.min(dp[i - 1][z], dp[i][z - 1]);
        }
    }

    return dp[grid.length - 1][grid[0].length - 1];
};

452. Minimum Number of Arrows to Burst Balloons

/**
 * @param {number[][]} points
 * @return {number}
 */
var findMinArrowShots = function(points) {
    // 이거 많이 풀어본 문젠디.//
    // [1,6][2,8][7,12][10,16]
    // 이제 6 으로 잡으면 ㅇㅋ

    points= points.sort((a,b)=>{
     return a[1]-b[1]
    })
    let start=points[0][1]
    let count=1;
    for(var i=1; i<points.length; i++){
            if(points[i][0]>start){
                //인경우에만
                start=points[i][1];
                count+=1;
            }
    }
    return count;
};