You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: Solution/437. Path Sum III/readme.md
+1-8Lines changed: 1 addition & 8 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,10 +1,6 @@
1
-
Sure! Here's the complete LeetCode-style `README.md` file for **437. Path Sum III**, in the format consistent with the ones from the `doocs/leetcode` GitHub repository.
2
1
3
-
---
4
-
5
-
```markdown
6
2
# 437. Path Sum III
7
-
3
+
---
8
4
## Description
9
5
10
6
Given the `root` of a binary tree and an integer `targetSum`, return *the number of paths where the sum of the values along the path equals*`targetSum`.
@@ -245,6 +241,3 @@ impl Solution {
245
241
**Difficulty:** Medium
246
242
**Related Topics:** Prefix Sum, Recursion
247
243
**Link:**[437. Path Sum III](https://leetcode.com/problems/path-sum-iii)
248
-
```
249
-
250
-
Let me know if you want the Chinese version, or a `.md` file to download.
0 commit comments