Today’s problem has less to do with computing Harshad
numbers—I was unaware of the name until I solved the problem, just a few days
before this went live—and much more to do with a piece of Java syntax that
tightens up conditionals. By now, you are certainly advanced enough in Java to have
come across it if you’ve looked anywhere else for tutorials, so I certainly
should address it here.
The problem is the following:
A number is a Harshad number if it’s divisible by the sum of its digits. Given
a number, figure out if it is one of these numbers. If it is, return the sum of
the digits. If it isn’t—as is convention when things fail, are not found, etc.—return
-1.
Here's the logic that gets it done:
public int sumOfTheDigitsOfHarshadNumber(int x) {
int num = x;
int currentDigit;
int sumOfDigits = 0;
while (x > 0) {
currentDigit = x % 10;
x /= 10;
sumOfDigits += currentDigit;
}
return num % sumOfDigits == 0 ? sumOfDigits : -1;
}
I need the parameter number x to do things to it—get its digits, etc.—but I
also need that value somewhere else for safekeeping. So I created another
variable, num, to also store the same value.
The variable currentDigit will store, as I’m looping through, the digit I’m
currently working on.
sumOfDigits is declared and initialized to 0 outside the
loop, naturally, to store the sum of the digits of the number, which will
determine if the number is a Harshad number or not.
Successively modding by 10 and dividing by 10 exposes and captures one digit at
a time from the right, i.e., the least significant places. I’m doing addition here,
so I don’t care much about the order of the numbers. This way works, and is
much easier than coming from the left, so I might as well do what I know well. As
I capture digits, I’m adding them to the running total of the sum of all the
number’s digits.
There aren’t any leading zeroes, so while the value of x (which is initially
the same as my parameter num) is bigger than zero, I can keep looping—I have to
keep looping—because I still have digits to process.
Once I finish looping, I can do my Harshad calculation. This
is the whole point of this article—that last line of code.
This is a ternary operator, a syntactical choice in Java and
other languages that allows programmers to condense if-else logic into one line.
The ternary statement a ? b : c is exactly equivalent to the more verbose
if(a){
b;
} else{
c;
}
Get used to reading and writing both styles. They are interchangeable, and a
good programmer knows and uses both.
Given this, that last line means the following: if num % sumOfDigits == 0 is true (that is, if num—passed in as x,
but I did all kinds of manipulation to
the original x, so I made a copy for this reason—is divisible by sumOfDigits),
then return sumOfDigits; if not, return -1.
No comments:
Post a Comment