Find the number of Divisors of a given Number in Java

package practice;

import java.util.ArrayList;
import java.util.Scanner;

public class DivisorSum {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		ArrayList<Integer> arrayList = new ArrayList<Integer>();
		int val = sc.nextInt();
		if (val > 0) {
			arrayList = countDivisor(val);
		} else {
			System.exit(0);
		}

		for (Integer a : arrayList) {
			System.out.println(a);
		}
	}

	private static ArrayList<Integer> countDivisor(int n) {
		int i;
		ArrayList al = new ArrayList<>();
		for (i = 1; i <= n; i++) {
			if (n % i == 0) {
				al.add(i);
			}
		}  
		return al;
	}
}

package practice;

import java.util.ArrayList;

import java.util.Scanner;

public class DivisorSum {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

ArrayList<Integer> arrayList = new ArrayList<Integer>();

int val = sc.nextInt();

if (val > 0) {

arrayList = countDivisor(val);

} else {

System.exit(0);

}

for (Integer a : arrayList) {

System.out.println(a);

}

private static ArrayList<Integer> countDivisor(int n) {

int i;

ArrayList al = new ArrayList<>();

for (i = 1; i <= n; i++) {

if (n % i == 0) {

al.add(i);

}

return al;

}

ElitmusZone