求大佬指点,我的代码错在哪了?(暴力dfs+回溯) int res = 0; void dfs(vector<int> grade, vector<int> val, int num, int cur,vector<bool> note) { //所有关卡打完,看得分是否比原来的大 if (num == grade.size()) { res = max(res, cur); return; } for (int i = 0; i < grade.size(); i++) { ...