목록java leetcode (5)

레벨업 일지

[Java] leetcode 1466. Reorder Routes to Make All Paths Lead to the City Zero

문제 https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/ Reorder Routes to Make All Paths Lead to the City Zero - LeetCode Can you solve this real interview question? Reorder Routes to Make All Paths Lead to the City Zero - There are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this netwo..
알고리즘/leetcode 2023. 3. 24. 11:29
[Java] leetcode 997. Find the Town Judge

문제 https://leetcode.com/problems/find-the-town-judge/description/ Find the Town Judge - LeetCode Find the Town Judge - In a town, there are n people labeled from 1 to n. There is a rumor that one of these people is secretly the town judge. If the town judge exists, then: 1. The town judge trusts nobody. 2. Everybody (except for the town judge) trusts leetcode.com 모든 사람의 신뢰를 받고, 그 자신은 아무도 믿지 않는 유..
알고리즘/leetcode 2023. 2. 23. 00:47
[Java] leetcode 1626. Best Team With No Conflicts

문제 https://leetcode.com/problems/best-team-with-no-conflicts/description/ Best Team With No Conflicts - LeetCode Can you solve this real interview question? Best Team With No Conflicts - You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of all t leetcode.com 알아야 할 개념 DFS + ..
알고리즘/leetcode 2023. 2. 12. 23:54
[Java/Python] leetcode 1137. N-th Tribonacci Number

문제 https://leetcode.com/problems/n-th-tribonacci-number/description/ N-th Tribonacci Number - LeetCode N-th Tribonacci Number - The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn. Example 1: Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 leetcode.com 트라이보나치 수열 값을 구해서 리턴할 것. 알아야 할 개..
알고리즘/leetcode 2023. 1. 31. 00:01
[Java] leetcode 909. Snakes and Ladders

문제 https://leetcode.com/problems/snakes-and-ladders/description/ Snakes and Ladders - LeetCode Snakes and Ladders - You are given an n x n integer matrix board where the cells are labeled from 1 to n2 in a Boustrophedon style [https://en.wikipedia.org/wiki/Boustrophedon] starting from the bottom left of the board (i.e. board[n - 1][0]) and alternati leetcode.com 알아야 할 개념 BFS 풀이 BFS 구현 문제이다. 풀이는 ..
알고리즘/leetcode 2023. 1. 25. 00:34
이전 Prev 1 Next 다음