给定一个数，输出所有小于等于该数的质数；如果没有质数，则输出0

package demo;

import java.util.Scanner;

/**
 * @author wyl
 * @time 2018年10月10日下午7:53:05
 */
public class Main2 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scanner=new Scanner(System.in);
		int n=scanner.nextInt();
		if (n<2) {
			System.out.println(0);
		}else if (n==2) {
			System.out.println(2);
		}else {
			for(int i=2;i<=n;i++){//is prime
				if (isPrime(i)) { //if prime ,print
					System.out.print(i+" ");
				}
			}
		}
	}

	private static boolean isPrime(int n) {
		// TODO Auto-generated method stub
		for(int i=2;i<n;i++){
			if (n%i==0) {
				return false;
			}
		}
		
		
		return true;
	}

}

package demo;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Solution{

    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        if (n < 2) {
            System.out.println(0);
            return;
        }
        if (n <= 2) {
            System.out.println("2");
            return;
        }

        ArrayList<Integer> primes = new ArrayList<>(Collections.singletonList(2));
        int count = 3;
        while (count <= n){
            for (Integer prime : primes) {
                if (count % prime == 0) break;
                if (Math.pow(prime, 2) > count){
                    primes.add(count);
                    break;
                }
            }
            ++count;
        }

        for (int i = 0; i < primes.size(); i++) {
            System.out.print(primes.get(i));
            if (i == primes.size() - 1) break;
            System.out.print(",");
        }
    }
}