Think in java 答案_Chapter 3_Exercise 9

阅前声明: http://blog.csdn.net/heimaoxiaozi/archive/2007/01/19/1487884.aspx 

/****************** Exercise 9 ******************
* Write a program that uses two nested for loops
* and the modulus operator (%) to detect and
* print prime numbers (integral numbers that are
* not evenly divisible by any other numbers
* except for themselves and 1).
***********************************************/
import java.util.*;

public class E09_FindPrimes {
  public static void main(String[] args) {
    int max = 100;
    // Get the max value from the command line,
    // if the argument has been provided:
    if(args.length != 0)
      max = Integer.parseInt(args[0]);
    for(int i = 1; i < max; i++) {
      boolean prime = true;
      for(int j = 2; j < i; j++)
        if(i % j == 0) prime = false;
      if(prime)
        System.out.println(i);
    }
  }
}

//+M java E09_FindPrimes

**I’ve thrown in a bit extra here, which is the possibility of taking the max value from the command line. If you want to get an argument from the command line there are a few things you need to know. First, arg[0] is not the name of the program, as it is in C, but rather the first command-line argument. Second, arguments come in as a String array, so you must perform the conversion to whatever you actually need. If you want an int, the method is not particularly obvious: it’s a static method of class Integer called parseInt( ). If you forget it, it can be a bit difficult to locate using the HTML documentation because you have to remember “parse” in order to find it, or that it’s part of class Integer.