路径之积c++(输出路径节点）

给一个二叉树和目标值，找出所有从根节点到叶子节点路径总积等于给定目标和的路径。

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

class TreeNode {
public:
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode() :val(0),left(nullptr),right(nullptr){}
	TreeNode(int value) :val(value), left(nullptr), right(nullptr) {}
};
vector<vector<int>> res;
void dfs(TreeNode *a, int num,const int &target, vector<int> temp) {
	if (a == nullptr) {
		return;
	}
	num = a->val*num;
	temp.emplace_back(a->val);
	if (a->left == nullptr&&a->right == nullptr&&num == target) {
		res.emplace_back(temp);
	}

	if (a->left) {
		dfs(a->left, num,target,temp);
	}
	if (a->right) {
		dfs(a->right, num,target,temp);
	}

}
int main() {
	TreeNode *a = new TreeNode(2);
	TreeNode *b = new TreeNode(9);
	TreeNode *c = new TreeNode(3);
	TreeNode *d = new TreeNode(2);
	TreeNode *e = new TreeNode(6);
	TreeNode *f = new TreeNode(7);
	
	a->left = b;
	a->right = c;
	b->left = d;
	c->left = e;
	c->right = f;

	int target;
	cout << "请输入目标值：";
	cin >> target;
	int len = 1;
	vector<int> temp;
	dfs(a,len,target,temp);

	if (res.size() == 0) {
		cout << "[" << "]"<<endl;
	}

	for (int i = 0; i < res.size(); ++i) {
		for (int j = 0; j<res[i].size(); ++j) {
			if (i == 0&&j == 0) {
				cout << "[" << "[";
			}
			else if (j == 0) {
				cout << "[";
			}
			cout << res[i][j];
			if (j != res[i].size() - 1) {
				cout << ",";
			}
			if (i == res.size()-1&&j == res[i].size()-1) {
				cout << "]" << "]"<<endl;
			}
			else if (j == res[i].size() - 1) {
				cout << "]";
			}
		}
	}

	system("pause");
}