剑指offer习题集1

vector<int> PrintFromTopToBottom(TreeNode *root) {

    vector<int> res;
    if (NULL == root)
        return res;

    TreeNode* node;
    deque<TreeNode*> tmp;
    tmp.push_back(root);

    while (tmp.size()) {

        node = tmp.front();
        res.push_back(node->val);
        tmp.pop_front();

        if (node->left)
            tmp.push_back(node->left);
        if (node->right)
            tmp.push_back(node->right);
    }
    return res;
}

class A{
    public: 
    A(){     
        ++n;sum+=n; 
    }  
    static int getsum(){  
        return sum;
    }
    static void reset(){
        n=0;sum=0;
    }
    ~A(){}
         
private:        
    static int n; 
    static int sum;
};
     
int A::n=0;
int A::sum=0;
 
class Solution {
public:
     
    int Sum_Solution(int n) {
         
        A::reset(); //必不可少,测试集会重复运行
         
        A* tmp=new A[n];
        delete[] tmp;
         
        return A::getsum();   
    }
};

class Solution {
public:
    void Mirror(TreeNode *pRoot) {
        
        if(NULL==pRoot||(NULL==pRoot->left&&NULL==pRoot->right))
            return;
        
        mirrorset(pRoot);
    }
    
    void mirrorset(TreeNode* root){
        
        if(NULL==root||(NULL==root->left&&NULL==root->right))
            return;
        
        TreeNode *tmp=root->left;
        root->left=root->right;
        root->right=tmp;
        
        if(root->left)
            mirrorset(root->left);
        if(root->right)
            mirrorset(root->right);
    }
};