经典算法-递归-一定区间的质数

import java.util.*;
public class Main {
 public static void main(String[] args) {
  Scanner sc = new Scanner(System.in);
  int q = sc.nextInt();
  int h = sc.nextInt();
  for (int i = q; i <= h; i++) {
   if (p(i)) {//进入方法判断
    System.out.println(i);
   }
  }
 }
 private static boolean p(int i) {
  for (int j = 2; j < i; j++) {
   if (i%j==0) {//若能除开其他数
    return false;//返回假
   }
  }
  return true;//否则返回真
 }
}