能求出的最大的Fibonacci数是多少?将一个多态的例子程序改为用interface实现。 编写一个程序统计给定文本中的单词总数。 使用StringTokenizer重做例子Filename。public class Filename {
private String fullPath;
private char pathSeparator, extensionSeparator; public Filename(String str, char sep, char ext) {
fullPath = str;
pathSeparator = sep;
extensionSeparator = ext;
} public String extension() {
int dot = fullPath.lastIndexOf(extensionSeparator);
return fullPath.substring(dot + 1);
} public String filename() {
int dot = fullPath.lastIndexOf(extensionSeparator);
int sep = fullPath.lastIndexOf(pathSeparator);
return fullPath.substring(sep + 1, dot);
} public String path() {
int sep = fullPath.lastIndexOf(pathSeparator);
return fullPath.substring(0, sep);
}
}public class FilenameDemo {
public static void main(String[] args) {
Filename myHomePage = new Filename("/home/mem/index.html",
'/', '.');
System.out.println("Extension = " + myHomePage.extension());
System.out.println("Filename = " + myHomePage.filename());
System.out.println("Path = " + myHomePage.path());
}
}public class Palindrome {
public static boolean isPalindrome(String stringToTest) {
String workingCopy = removeJunk(stringToTest);
String reversedCopy = reverse(workingCopy); return reversedCopy.equalsIgnoreCase(workingCopy);
} protected static String removeJunk(String string) {
int i, len = string.length();
StringBuffer dest = new StringBuffer(len);
char c; for (i = (len - 1); i >= 0; i--) {
c = string.charAt(i);
if (Character.isLetterOrDigit(c)) {
dest.append(c);
}
} return dest.toString();
} protected static String reverse(String string) {
StringBuffer sb = new StringBuffer(string); return sb.reverse().toString();
} public static void main(String[] args) {
String string = "Madam, I'm Adam."; System.out.println();
System.out.println("Testing whether the following "
+ "string is a palindrome:");
System.out.println(" " + string);
System.out.println(); if (isPalindrome(string)) {
System.out.println("It IS a palindrome!");
} else {
System.out.println("It is NOT a palindrome!");
}
System.out.println();
}
}
private String fullPath;
private char pathSeparator, extensionSeparator; public Filename(String str, char sep, char ext) {
fullPath = str;
pathSeparator = sep;
extensionSeparator = ext;
} public String extension() {
int dot = fullPath.lastIndexOf(extensionSeparator);
return fullPath.substring(dot + 1);
} public String filename() {
int dot = fullPath.lastIndexOf(extensionSeparator);
int sep = fullPath.lastIndexOf(pathSeparator);
return fullPath.substring(sep + 1, dot);
} public String path() {
int sep = fullPath.lastIndexOf(pathSeparator);
return fullPath.substring(0, sep);
}
}public class FilenameDemo {
public static void main(String[] args) {
Filename myHomePage = new Filename("/home/mem/index.html",
'/', '.');
System.out.println("Extension = " + myHomePage.extension());
System.out.println("Filename = " + myHomePage.filename());
System.out.println("Path = " + myHomePage.path());
}
}public class Palindrome {
public static boolean isPalindrome(String stringToTest) {
String workingCopy = removeJunk(stringToTest);
String reversedCopy = reverse(workingCopy); return reversedCopy.equalsIgnoreCase(workingCopy);
} protected static String removeJunk(String string) {
int i, len = string.length();
StringBuffer dest = new StringBuffer(len);
char c; for (i = (len - 1); i >= 0; i--) {
c = string.charAt(i);
if (Character.isLetterOrDigit(c)) {
dest.append(c);
}
} return dest.toString();
} protected static String reverse(String string) {
StringBuffer sb = new StringBuffer(string); return sb.reverse().toString();
} public static void main(String[] args) {
String string = "Madam, I'm Adam."; System.out.println();
System.out.println("Testing whether the following "
+ "string is a palindrome:");
System.out.println(" " + string);
System.out.println(); if (isPalindrome(string)) {
System.out.println("It IS a palindrome!");
} else {
System.out.println("It is NOT a palindrome!");
}
System.out.println();
}
}
不清楚JAVA的类和方法的调用,刚学JAVA就要做那么多作业,应付不过来~~
所以上来求救~~
import java.math.BigInteger;
public class Test
{
public static void main(String args[])
{
BigInteger a=new BigInteger("1");
BigInteger b=new BigInteger("1");
BigInteger f=new BigInteger("1");
for (int i = 0; i<100; i++)
{
f=a.add(b);
System.out.println (f);
a=b;
b=f;
}
}
}