题目:
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Finish the solution so that it returns the sum of all the multiples of 3 or 5 below the number passed in. Additionally, if the number is negative, return 0 (for languages that do have them).
Note: If the number is a multiple of both 3 and 5, only count it once.
菜逼 (我)写的:
int solution(int number)
{
int sum = 0, sum1 = 0, sum2 = 0;
int a, b;
int i;
if (number < 0) {
number = 0;
}
else if (number >= 0) {
for (i = 0; i < number; i++) {
if (i % 3 == 0 || i % 5 == 0) {
sum += i;
}
else if (i % 3 == 0) {
sum1 += i;
}
else if (i % 5 == 0) {
sum2 += i;
}
}
}
return (sum + sum1 + sum2);
}
高手写的:
int solution(int number)
{
int sum = 0;
for (int n = 3; n < number; n++) {
if ((n%3 == 0) || (n%5 == 0))
sum += n;
}
return sum;
}