从零开始的刷LeetCode生活 第25期 257-260

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<string>res;
    vector<string> binaryTreePaths(TreeNode* root) {
        string path;
        dfs(root, path);
        return res;
    }

    void dfs(TreeNode *root, string path)
    {
        if(!root) return;
        if(path.size()) path += "->";
        path += to_string(root->val);
        if(!root->left && !root->right) res.push_back(path);
        else
        {
            dfs(root->left, path);
            dfs(root->right, path);
        }
    }
};

class Solution {
public:
    int addDigits(int num) {
        while(num >= 10)
        {
            int tot = 0;
            for( ; num > 0; num /= 10)
                tot += num % 10;
            num = tot;
        }
        return num;
    }
};

class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
        int s = 0; 
        for(auto x : nums) s ^= x;
        int k = 0;
        while(!(s >> k & 1)) k ++;
        int s1 = 0, s2 = 0;
        for(auto x : nums)
        {
            if(x >> k & 1)
                s1 ^= x;
            else 
                s2 ^= x;
        } 
        return vector<int>{s1, s2};
    }
};