-
-
Notifications
You must be signed in to change notification settings - Fork 437
Happy Number #51
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Happy Number #51
Changes from 8 commits
Commits
Show all changes
10 commits
Select commit
Hold shift + click to select a range
94d099f
Happy Number
ifenil 9d36ef7
Merge remote-tracking branch 'upstream/master' into master
ifenil 46c5fe1
Merge branch 'master' into master
ifenil dd49a65
Power of Three
ifenil e0ca375
Power of Three
ifenil c273465
Solution without HashSet
ifenil fed6f4d
Merge branch 'master' into master
ifenil 6aa2395
Update README.md
ifenil 503d1c3
Updated readme
ifenil bce43e2
Update README.md
ifenil File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,31 @@ | ||
| class HappyNumber { | ||
| public boolean isHappy(int n) { | ||
| int num1, num2; | ||
|
|
||
| num1 = num2 = n; | ||
| do | ||
| { | ||
| num1 = SquareSum(num1); | ||
|
|
||
|
|
||
| num2 = SquareSum(SquareSum(num2)); | ||
|
|
||
| } | ||
| while (num1 != num2); | ||
|
|
||
| return (num1 == 1); | ||
| } | ||
|
|
||
|
|
||
| static int SquareSum(int n) | ||
| { | ||
| int square = 0; | ||
| while (n!= 0) | ||
| { | ||
| square += (n % 10) * (n % 10); | ||
| n /= 10; | ||
| } | ||
| return square; | ||
| } | ||
|
|
||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,15 @@ | ||
| class Solution { | ||
| public boolean isPowerOfThree(int n) { | ||
|
|
||
| if(n < 1) | ||
| { | ||
| return false; | ||
| } | ||
|
|
||
| while(n % 3 == 0) | ||
| { | ||
| n = n/3; | ||
| } | ||
| return n==1; | ||
| } | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
and this one too