有符号数、无符号树混合计算问题。

 1 // maxDepth.cpp : 定义控制台应用程序的入口点。
 2 //
 3 
 4 #include "stdafx.h"
 5 #include<vector>
 6 #include<iostream>
 7 #include<limits.h>
 8 
 9 using namespace std;
10 
11 class TreeNode {
12 public:
13      int val;
14      TreeNode *left, *right;
15      TreeNode(int val) {
16          this->val = val;
17          this->left = this->right = NULL;
18      }
19  }; 
20 
21 class Solution {
22 public:
23     /**
24      * @param root: The root of binary tree.
25      * @return: An integer
26      */
27     void PreOrder(TreeNode *root, std::vector<TreeNode*> &path)
28     {
29         if (!root)
30             return;
31         path.push_back(root);
32         if(!root->left && !root->right)
33             if (path.size() > max)
34                 max = path.size();
35         if(root->left) PreOrder(root->left, path);
36         if(root->right) PreOrder(root->right, path);
37         path.pop_back();        
38     }
39     int maxDepth(TreeNode *root) {
40         // write your code here
41         if (!root)
42             return 0;
43         std::vector<TreeNode*> path;
44         PreOrder(root, path); 
45         return max;
46     }
47     Solution():max(INT_MIN){;}
48 private:
49     int max;
50 };
51 
52 void Test()
53 {
54     int c = -1;
55     if (c > (unsigned)1)std::cout << "c > -1" << std::endl;
56     c = INT_MIN;
57     //std::cout << c;
58     //std::cout << 
59     
60     std::cout << -7 + (unsigned)5 << std::endl;
61     std::cout << -7 + (unsigned)10 << std::endl;
62 
63     //bool b = c > 1;
64     //std::cout << b ;
65 
66 }
67 
68 int _tmain(int argc, _TCHAR* argv[])
69 {
70     TreeNode *root = new TreeNode(0);
71     Solution so;
72     std::cout << so.maxDepth(root) << std::endl;
73 
74     Test();
75 
76 
77     
78     return 0;
79 }