判斷迴文數、質數的最簡單算法

 public static boolean isHuiWenShu(int num) {
      int max=num;
      int min=0;
      while(max!=0) {
          int d=max%10;
          max=max/10;
          min=10*min+d;
      }
      return num==min;
  }
  public static boolean isZhiShu(int num) {
      int flag=1;
          for (int count = 2; count < num; count++) {
              if (num % count == 0) flag=0;
          }
      if( num==1) flag=2;
      if(flag==1){
          flag=2;
          return true;}
      else{
          flag=2;
          return false;}
  }
  ```