Brian Kernighan 求解 set bit 个数
基础知识 位的命名 二进制位由 0 与 1 组成, 把不同的位分别定义如下： 把值为 1 的位称为 set bit 值为 0 的称为 unset bit 如下图所示，上面的部分为 set bit，下面的为 unset bit 按位与操作(&) 按位与操作：bitwise AND operator ...
Leetcodes
Coin Change
Coin Change II In the “Coin Change II” problem, we are given coins of various denominations and a specific amount. Our task is to determine the number of different ways we can make up that amount using the coins. Unlike other coin change problems where we need to minimize or maximize the number of coins, here we need to find the total number of possible combinations. For instance, with coins [1,2,5] and amount 5, we have the following combinations: ...
一文看懂快慢指针解法
简介 快慢指针的解法在 LeetCode 中非常常见，尤其是涉及到链表有环的情况下。 我们常说的快慢指针解法，其实就是 Floyd 环形检测算法，这个算法会在链表的头部初始化两个指针，分别称为快指针和慢指针。慢指针每次走一步，快指针每次走两步。 ...