程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> LeetCode 257:Binary Tree Paths

LeetCode 257:Binary Tree Paths

編輯:C++入門知識

LeetCode 257:Binary Tree Paths


Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

 

   1
 /   \
2     3
 \
  5

 

All root-to-leaf paths are:

["1->2->5", "1->3"]

 

Credits:

Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

 

//簡單的二叉樹遍歷,遍歷的過程中記錄之前的路徑,一旦遍歷到葉子節點便將該路徑加入結果中。
class Solution {
public:
	vector binaryTreePaths(TreeNode* root) {
		vector res;
		if (root==NULL)   return res;
		binaryTreePaths(res, root, to_string(root->val));
		return res;
	}

	void binaryTreePaths(vector& result, TreeNode* node, string s) {
		if (node->left==NULL && node->right==NULL)
		{
			result.push_back(s);
			return;
		}
		if (node->left)     binaryTreePaths(result, node->left, s + "->" + to_string(node->left->val));
		if (node->right)    binaryTreePaths(result, node->right, s + "->" + to_string(node->right->val));
	}
};

\

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved