![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
fantongl
这个作者很懒,什么都没留下…
展开
-
计算十进制数转换为二进制时“1”的个数
计算十进制数转换为二进制时“1”的个数int count(int num){ int res = 0; while(num != 0) { num = num & (num - 1); res++; } return res;}原创 2021-06-21 10:01:04 · 119 阅读 · 0 评论 -
LeetCode_19_删除单链表倒数第N个结点
LeetCode1. 递归做法class Solution {public: int cur = 0; ListNode* removeNthFromEnd(ListNode* head, int n) { if(head == NULL) return NULL; head->next = removeNthFromEnd(head->next,n); cur++; if(n == c原创 2021-04-25 23:31:49 · 68 阅读 · 0 评论