Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
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 }}
Pancf
Algorithm
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Algorithm
/
Add.cpp
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
35 lines (35 loc) · 1.14 KB
master
Breadcrumbs
Algorithm
/
Add.cpp
Copy path
Top
File metadata and controls
Code
Blame
35 lines (35 loc) · 1.14 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
/*
* 题:写一个函数,求两个整数之和,要求在函数体内不得使用+、-、/、*四则运算
* 符号
*/
class solution{
public:
/*
* 题目要求不能使用四则运算符号,那么就要考虑位运算了
* 通过观察可知num1&num2的结果中1所在的位置表示两个二进制数相加有进
* 位的地方
* num1^num2的结果中1所在位置表示二进制数正常相加的地方
* for example: 0111+1001=10000,0111&1001=0001,0111^1001=1110
* 显然最低位的1就是有进位的位置,另外三个位置正常相加
* 所以0111+1001等价于1110+0001<<1=1110+0010
* 由此可得:
* 1)若当前表示进位的数字num2不为0,那么num1等于num1和num2异或
* num2=num1和num2相与然后再左移1位
* 2)如果num2不为0,重复1),直至num2==0,此时返回num1
*/
int Add(int num1, int num2){
while(num2){
int tmp=num1&num2;
num1^=num2;
num2=tmp<<1;
}
return num1;
}
}
//还有一种更简洁但是使用了递归的版本
class solution{
public:
int Add(int num1, int num2){
return num2?Add(num1^num2,(num1&num2)<<1):num1;
}
}
You can’t perform that action at this time.