LeetCode-236 二叉树的最近公共祖先

二叉树的最近公共祖先

class Solution {
public:
	vector<TreeNode*> path;
	vector<vector<TreeNode*>> result;
	int flag_1 = false;
	int flag_2 = false;
	TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
		//首先先求出二叉树到根节点的路径,都是深度遍历的变体方法
		lujing(root, p, flag_1);
		lujing(root, q, flag_2);
		//进行下一步
		vector<TreeNode*> path_1 = result[0];
		vector<TreeNode*> path_2 = result[1];
		int min_len = min(path_1.size(), path_2.size());
		TreeNode* shuchu =NULL;
        for (int i = 0; i<min_len; ++i)
        {
            if (path_1[i] == path_2[i])
                shuchu = path_1[i];
        }
		return shuchu;
	}
	void lujing(TreeNode* root, TreeNode*target, int &flag)
	{
		if (root == NULL || flag == true)
			return;
		path.push_back(root);
		if (root == target)
		{
			result.push_back(path);
			flag = true;
		}
		lujing(root->left, target, flag);
		lujing(root->right, target, flag);
		path.pop_back();
	}
};