Skip to content

Banhat #30

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.

Sign up for GitHub

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

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open

Banhat #30

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
86d5281
Add file test
nhattech Sep 12, 2022
b12a25d
Check n == null
nhattech Sep 12, 2022
1d8b3ae
Check parseInt
nhattech Sep 12, 2022
91ca25b
Check parseLong
nhattech Sep 12, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Check parseInt
  • Loading branch information
@nhattech
nhattech committed Sep 12, 2022
commit 1d8b3ae01f49ee557e98d79c5cc628a53f5333ef
6 changes: 5 additions & 1 deletion src/main/java/com/hackerrank/algorithms/recursion/RecursiveDigitSum.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -24,7 +24,11 @@ public class RecursiveDigitSum {
private static int superDigit(String n, int k) {
if(n == null) throw new Exception("by input exception [" + n + "]");
if (n.length() == 1 && k == 0) {
return Integer.parseInt(n);
try {
return Integer.parseInt(n);
}catch (Exception e) {
throw new Exception("by input exception [" + n + "]");
}
}

Long sum = 0L;
Expand Down