
剑指Offer
CCSUZB
吾生也有涯,而知也无涯
展开
-
重建二叉树
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti...原创 2018-12-27 11:00:43 · 128 阅读 · 0 评论 -
二进制中1的个数
class Solution { public: int NumberOf1(int n) { int count=0; while(n) { count++; n=n&(n-1); } return count; } }; ...原创 2018-12-28 14:43:09 · 186 阅读 · 0 评论