Skip to content

Commit

Permalink
Add files via upload
Browse files Browse the repository at this point in the history
  • Loading branch information
adwaittathe authored May 23, 2019
1 parent c6d278b commit 6ab5e4b
Show file tree
Hide file tree
Showing 2 changed files with 34 additions and 0 deletions.
21 changes: 21 additions & 0 deletions Number Complement/Number Complement.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
class Solution
{
public int findComplement(int a)
{
String s="";
while(a>0)
{
if(a%2==1)
{
s+=""+0;
}
else
{
s+=""+1;
}
a=a/2;
}
s=new StringBuffer(s).reverse().toString();
return Integer.parseInt(s,2);
}
}
13 changes: 13 additions & 0 deletions Number Complement/ReadMe.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

Note:
The given integer is guaranteed to fit within the range of a 32-bit signed integer.
You could assume no leading zero bit in the integer�s binary representation.
Example 1:
Input: 5
Output: 2
Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
Example 2:
Input: 1
Output: 0
Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.

0 comments on commit 6ab5e4b

Please sign in to comment.