LeetCode 5354. 通知所有员工所需的时间(迭代)

class Solution {
public:
    int numOfMinutes(int n, int root, vector<int>& m, vector<int>& info) {
        int ans = 0;
        for(int i=0;i<n;i++){
            if(info[i] == 0){      // 判断是否是叶子节点
                int xx = i;
                int sum = 0;
                while(xx != -1){
                    sum += info[xx];
                    xx = m[xx];
                }
                ans = max(ans, sum);
            }
        }
        return ans;
    }
};