Title: leetcode112:路径总和 · Issue #45 · sisterAn/JavaScript-Algorithms · GitHub
Open Graph Title: leetcode112:路径总和 · Issue #45 · sisterAn/JavaScript-Algorithms
X Title: leetcode112:路径总和 · Issue #45 · sisterAn/JavaScript-Algorithms
Description: 给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和。 说明: 叶子节点是指没有子节点的节点。 示例: 给定如下二叉树,以及目标和 sum = 22 , 5 / \ 4 8 / / \ 11 13 4 / \ \ 7 2 1 返回 true , 因为存在目标和为 22 的根节点到叶子节点的路径 5->4->11->2。 附赠leetcode地址:leetcode
Open Graph Description: 给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和。 说明: 叶子节点是指没有子节点的节点。 示例: 给定如下二叉树,以及目标和 sum = 22 , 5 / \ 4 8 / / \ 11 13 4 / \ \ 7 2 1 返回 true , 因为存在目标和为 22 的根节点到叶子节点的路径 5->4->11->2。 附赠leetcode...
X Description: 给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和。 说明: 叶子节点是指没有子节点的节点。 示例: 给定如下二叉树,以及目标和 sum = 22 , 5 / \ 4 8 / / \ 11 13 4 / \ \ 7 2 1 返回 true , 因为存在目标和为 22 的根节点到叶子节点的路径 5->4->11->2。 附...
Opengraph URL: https://github.com/sisterAn/JavaScript-Algorithms/issues/45
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"leetcode112:路径总和","articleBody":"给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和。\r\n\r\n**说明:** 叶子节点是指没有子节点的节点。\r\n\r\n**示例:** \r\n给定如下二叉树,以及目标和 `sum = 22` ,\r\n\r\n 5\r\n / \\\r\n 4 8\r\n / / \\\r\n 11 13 4\r\n / \\ \\\r\n 7 2 1\r\n返回 `true` , 因为存在目标和为 `22` 的根节点到叶子节点的路径 `5-\u003e4-\u003e11-\u003e2`。\r\n附赠leetcode地址:[leetcode](https://leetcode-cn.com/problems/path-sum/solution/javascript-lu-jing-zong-he-by-user7746o/)","author":{"url":"https://github.com/sisterAn","@type":"Person","name":"sisterAn"},"datePublished":"2020-05-19T15:02:48.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":6},"url":"https://github.com/45/JavaScript-Algorithms/issues/45"}
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:b750bc88-b415-a8d7-ffa7-ce054810837a |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | DC60:378C0F:32CFE5:46EACA:696A68A7 |
| html-safe-nonce | a9328bf478c129696a0d88d58f74a37d763159c5452c6f0ac60299ec4e9a50f0 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJEQzYwOjM3OEMwRjozMkNGRTU6NDZFQUNBOjY5NkE2OEE3IiwidmlzaXRvcl9pZCI6IjkyMzA1NTAyODQ5MjIwMDEwMyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9 |
| visitor-hmac | ae6e1054bcb79adadd2c913b2504818367e4e89f338c82fbc45992b816b4e91a |
| hovercard-subject-tag | issue:621051333 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/sisterAn/JavaScript-Algorithms/45/issue_layout |
| twitter:image | https://opengraph.githubassets.com/3096c336a2f773cbeac01cf3f1f5703f1a392f047eadcf9469b51c848b06874d/sisterAn/JavaScript-Algorithms/issues/45 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/3096c336a2f773cbeac01cf3f1f5703f1a392f047eadcf9469b51c848b06874d/sisterAn/JavaScript-Algorithms/issues/45 |
| og:image:alt | 给定一个二叉树和一个目标和,判断该树中是否存在根节点到叶子节点的路径,这条路径上所有节点值相加等于目标和。 说明: 叶子节点是指没有子节点的节点。 示例: 给定如下二叉树,以及目标和 sum = 22 , 5 / \ 4 8 / / \ 11 13 4 / \ \ 7 2 1 返回 true , 因为存在目标和为 22 的根节点到叶子节点的路径 5->4->11->2。 附赠leetcode... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | sisterAn |
| hostname | github.com |
| expected-hostname | github.com |
| None | 6fea32d5b7276b841b7a803796d9715bc6cfb31ed549fdf9de2948ac25d12ba6 |
| turbo-cache-control | no-preview |
| go-import | github.com/sisterAn/JavaScript-Algorithms git https://github.com/sisterAn/JavaScript-Algorithms.git |
| octolytics-dimension-user_id | 19721451 |
| octolytics-dimension-user_login | sisterAn |
| octolytics-dimension-repository_id | 252061924 |
| octolytics-dimension-repository_nwo | sisterAn/JavaScript-Algorithms |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 252061924 |
| octolytics-dimension-repository_network_root_nwo | sisterAn/JavaScript-Algorithms |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | f2d9f6432a5a115ec709295ae70623f33bb80aee |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width