upd

2026-06-05 22:32:49 +08:00
parent 14d05011d5
commit c67841fe07
202 changed files with 498 additions and 403 deletions
@@ -40,7 +40,7 @@ Explanation: The optimal path is 15 -> 20 -> 7 with a path sum of 15 + 20 + 7 =
 Write your approach here.

 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 124 :lc-lang python3
 # Definition for a binary tree node.
 # class TreeNode:
 #     def __init__(self, val=0, left=None, right=None):
@@ -52,7 +52,7 @@ class Solution:
 #+end_src

 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 124
 /**
 * Definition for a binary tree node.
 * struct TreeNode {