自己的做题记录，太懒了，很多题目待分类整理...
-
对于二进制数 n：
n = n & (n - 1)可以去掉 n 最右边的一个 1 -
判断奇偶
n&1二进制二进制末尾：1奇数，0偶数 -
取反
n^1 -
奇偶关系
- num偶数，则mid + 1 === mid ^ 1
- num奇数，则mid - 1 === mid ^ 1
-
Notifications
You must be signed in to change notification settings - Fork 0
lzxjack/LeetCode-JavaScript
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
自己写的JavaScript版leetcode做题记录。
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published