upd

2026-06-05 22:32:49 +08:00
parent 14d05011d5
commit c67841fe07
202 changed files with 498 additions and 403 deletions
@@ -69,13 +69,13 @@ The optimal path with no stops from city 0 to 2 is marked in red and has cost 50
 Write your approach here.

 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 787 :lc-lang python3
 class Solution:
    def findCheapestPrice(self, n: int, flights: List[List[int]], src: int, dst: int, k: int) -> int:
 #+end_src

 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 787
 class Solution {
 public:
    int findCheapestPrice(int n, vector<vector<int>>& flights, int src, int dst, int k) {