JAVA:实现Harshad Number哈沙德数算法(附完整源码)

package com.thealgorithms.maths;

import java.util.Scanner;

public class HarshadNumber {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a number : ");
        long a = sc.nextLong();

        checkHarshadNumber(a);
    }


    public static void checkHarshadNumber(long a) {

        long b = a;
        int sum = 0;

        // this is just for showing the explanation else it's of no use you can ommit it
        int[] each = new int[Long.toString(a).length()];

        int c = 0;

        while (b > 0) {
            sum += b % 10;
            each[c] = (int) (b % 10);
            b /= 10;
            c++;
        }

        if (a % sum == 0) {
            System.out.println(a + " is a Harshad Number");

            // For you better explanation how is that a Harshad Number
            System.out.println("\nExplaination :");

            for (int i = each.length - 1; i >= 0; i--) {
                System.out.print(each[i] + " ");
                if (i != 0) {
                    System.out.print("+ ");
                }
            }

            System.out.println("= " + sum);
            System.out.println(sum + " × " + (a / sum) + " = " + a);
        } else {
            System.out.println(a + " is not a Harshad Number");
        }
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53