{"blog_url":"https://mhiro216.hatenablog.com/","provider_url":"https://hatena.blog","type":"rich","description":"https://leetcode.com/problems/path-sum/ Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. Note: A leaf is a node with no children. Example: Given the below binary tree and sum = 22, return true, as the\u2026","author_name":"mhiro216","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmhiro216.hatenablog.com%2Fentry%2F2019%2F08%2F06%2F231212\" title=\"LeetCode / Path Sum - \u30aa\u30c3\u30c8\u30bb\u30a4\u306e\u7d4c\u55b6\u65e5\u8a8c\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","published":"2019-08-06 23:12:12","width":"100%","version":"1.0","categories":["LeetCode"],"author_url":"https://blog.hatena.ne.jp/mhiro216/","title":"LeetCode / Path Sum","image_url":"https://chart.apis.google.com/chart?cht=tx&chl=%20O%28n%20%2A%20h%29","blog_title":"\u30aa\u30c3\u30c8\u30bb\u30a4\u306e\u7d4c\u55b6\u65e5\u8a8c","url":"https://mhiro216.hatenablog.com/entry/2019/08/06/231212","height":"190"}