ARTS-week48

Algorithms

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
public:
    vector<vector<int>> levelOrder(Node* root) {
        vector<vector<int>> res;
        if (!root) {
            return res;
        }
        helper(root, 0, res);
        return res;
    }
    
    void helper(Node* node, int level, vector<vector<int>>& res)
    {
        if (res.size() <= level) {
            res.resize(res.size() + 1);
        }
        res[level].push_back(node->val);
        for(auto i : node->children) {
            helper(i, level + 1, res); 
        }
    }
};

Number of Segments in a String

class Solution {
public:
    int countSegments(string s) {
        int res = 0, n = s.size();
        for (int i = 0; i < n; ++i) {
            if (s[i] == ' ') {
                continue;
            }
            ++res;
            while (i < n && s[i] != ' ') ++i;
        }
        return res;
    }
};