미소를뿌리는감자의 코딩

https://leetcode.com/problems/cheapest-flights-within-k-stops/description/ Cheapest Flights Within K Stops - LeetCode Can you solve this real interview question? Cheapest Flights Within K Stops - There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to leetcode.com 1. 접근 방법 노..

https://leetcode.com/problems/network-delay-time/description/ Network Delay Time - LeetCode Can you solve this real interview question? Network Delay Time - You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the tar leetcode.com 1. 접근 방법 이번 문제는 Dijkstra 문제로, Dijkst..

https://leetcode.com/problems/search-a-2d-matrix-ii/description/ Search a 2D Matrix II - LeetCode Can you solve this real interview question? Search a 2D Matrix II - Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: * Integers in each row are sorted in ascending fr leetcode.com 1. 접근 방법 matrix에 대해서, 가로-세로로 구..

https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/ Two Sum II - Input Array Is Sorted - LeetCode Can you solve this real interview question? Two Sum II - Input Array Is Sorted - Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two n leetcode.com 1. 접근 ..