-
https://leetcode.com/problems/course-schedule/
// ___________________문제___________________
// Cycle이 있는지 판단하기
// __________________Syntax__________________
//
// ________________Algorithms________________
//
// ____________________Input___________________
// prerequisites: [[4, 2], [4, 1], [2, 3], [2, 1], [3, 0], [2, 0], [1, 0]];
1. 배열.push(val)의 return 값
for(let i = 0; i < prerequisites.length; i++) {
let start = prerequisites[i][1];
let end = prerequisites[i][0];
array[start] = array[start] ? array[start].push(end) : [end];
}
array[index] = array[index] ? array[index].push(val) : [val];
array[index].push(val)은 배열 길이를 return한다.
'알고리즘 > 리트코드' 카테고리의 다른 글
542. 01 Matrix (0) 2021.05.27 210. Course Schedule II (0) 2021.05.24 1277. Count Square Submatrices with All Ones (0) 2021.05.23 152. Maximum Product Subarray (0) 2021.05.23 53. Maximum Subarray (0) 2021.05.23 댓글