新手需要框架（Beginners need frames）.doc

新手需要框架（Beginners need frames） 1. write a method to print a 99 multiplication table with a for loop *//** / * * * 99 print multiplication table * / Public, void, nineNineMulitTable () { For (int i = 1, j = 1; J 9; i++) { System.out.print (i+ * *, +j+ = = +i*j+); If (i==j) { I=0; J++; System.out.println (); } } } 2., given how a java.util.Date object is converted into 2007-3-22 20:23:22 format string *//** / * * * convert a date into a string in a fixed format * @param date * @return str * / Public String date2FormatStr (Date date) { SimpleDateFormat SDF = new SimpleDateFormat (yyyy-MM-dd HH:mm:ss); String STR = sdf.format (date); Return str; } 3. write a method that can determine whether any integer is a prime number *//** / * * * to determine whether any integer is a prime number * @param num * @return Boolean * / Public Boolean isPrimeNumber (int Num) { For (int i = 2; I Math.sqrt (Num); i++) { If (num%i==0) { Return false; } } Return true; } 4. write a method, enter any integer, return its factorial *//** / * * * obtain the factorial of any integer *@param n *@returnn! * / Public int factorial (int Num) { / / recursive If (Num = 1) { Return 1; } Return num*factorial (num-1); } 5. write a method, using two point search method to determine any integer in any integer array, whether it exists, if it exists, returns its index position in the array, there is no return -1 *//** / * * * two to find the position of a particular integer in an integer array (recursive) *@param dataset *@param data *@param beginIndex *@param endIndex *@return index * / Public, int, binarySearch (int[], dataset, int, data, int, beginIndex, int, endIndex) { Int midIndex = (beginIndex+endIndex) /2; If the search number / / than the start index data is smaller than to end or indexed book to, or start searching the index value is greater than the end of the index return -1 not found If (data, dataset[beginIndex]||datadataset[endIndex]||beginIndexendIndex) { Return -1; } If (data, dataset[midInde