Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
javaCoderTeam
coding-interviews
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
coding-interviews
/
code
/
offer
/
src
/
Chap2
/
NumberOf1.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
72 lines (65 loc) · 1.71 KB
master
Breadcrumbs
coding-interviews
/
code
/
offer
/
src
/
Chap2
/
NumberOf1.java
Copy path
Top
File metadata and controls
Code
Blame
72 lines (65 loc) · 1.71 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
package
Chap2
;
/**
* 输入一个整数,输出该数二进制表示中1的个数。其中负数用补码表示。
*/
public
class
NumberOf1
{
/**
* 减1后的值比原值相与,就是将二进制表示中最后一个1变成0
*/
public
int
numberOf1
(
int
n
) {
int
count
=
0
;
while
(
n
!=
0
) {
n
= (
n
-
1
) &
n
;
count
++;
}
return
count
;
}
/**
* 左移版本
*/
public
int
numberOf1_1
(
int
n
) {
int
count
=
0
;
int
flag
=
1
;
while
(
flag
!=
0
) {
if
((
n
&
flag
)!=
0
) {
count
++;
}
flag
=
flag
<<
1
;
}
return
count
;
}
/**
* Java中的无符号右移 >>> 不论正负数都是补0
*/
public
int
numberOf1_2
(
int
n
) {
int
count
=
0
;
while
(
n
!=
0
) {
if
((
n
&
1
) ==
1
) {
count
++;
}
n
=
n
>>>
1
;
}
return
count
;
}
/**
* 判断一个整数是不是2的正整数次方。
*/
public
boolean
isExponOf2
(
int
n
) {
return
numberOf1
(
n
) ==
1
;
}
/**
* 输入两个整数m和n,计算需要改变m的二进制表示中的几位才能得到n。
* 比如10的二进制是1010,13的二进制是1101,则需要改变3次。
* @param m 一个整数
* @param n 另一个整数
* @return 需要改变的位数
*/
public
int
bitNumNeedsToBeChanged
(
int
m
,
int
n
) {
return
numberOf1
(
m
^
n
);
}
public
static
void
main
(
String
[]
args
) {
NumberOf1
a
=
new
NumberOf1
();
System
.
out
.
println
(
a
.
isExponOf2
(
8
));
System
.
out
.
println
(
a
.
bitNumNeedsToBeChanged
(
10
,
13
));
}
}
You can’t perform that action at this time.