呦看清三五魔芋's 修行路

//Definition for binary tree //struct TreeNode { // int val; // struct TreeNode *left; // struct TreeNode *right; // }; int maxDepth(struct TreeNode *root) { ////////////////////////////////

int singleNumber(int A[], int n) { int num = 0; for(int i = 0; i < n; ++i) { num ^= A[i]; } return num; }