穿过雾的阴霾

摘要： class Solution { public: int NumberOf1(int n) { int res=0; for (int i = 0; i < 32; i ++ ) res+=(n>>i)&1; return res; } }; 阅读全文

摘要： class Solution { public: ListNode* reverseKGroup(ListNode* head, int k) { ListNode* dummy=new ListNode(-1,head),*tail=dummy; while(tail) { ListNode* t 阅读全文