刚看了几天java,这是我前天做的。你看一下
public class MulTable {
public static void main(String[] args){
for(int i=1;i<10;i++){
for(int j=1;j<10;j++){
System.out.print(i+"*"+j+"="+i*j+" ");
if(j==i){
System.out.println("");break;
}//此部分是乘法表
/*System.out.print("*"+" ");
if(j==i){
System.out.println("");break;
}*///此部分代替上面的就是杨辉三角 }
}
}
}
public static void main(String[] args)
{
for (int i = 1; i <= 9; i++)
{
for (int j = 1; j <= i; j++)
{
String result="";
int sum=i*j;
result=sum>=10?sum+"":" "+sum;
System.out.print(j+"*"+i+"="+result+" ");
}
System.out.println();
}
}
import java.io.*;
import java.util.*;
class SimpleLocalDriveSearch {
private List result = new ArrayList( );
private void recursiveSearch( File rootDir, String suffix ) {
File[ ] files = rootDir.listFiles( );
if ( files != null )
for ( int i = 0; i < files.length; i++ ) {
if ( files[ i ].isFile( ) && files[ i ].getName( ).endsWith( suffix ) )
result.add( files[ i ] );
recursiveSearch( files[ i ], suffix );
}
}
public List search( File startDir, String matchingExtension ) {
result.clear( );
recursiveSearch( startDir, "." + matchingExtension );
return result;
}
public static void main( String[ ] args ) throws Exception {
System.out.println( "Enter the extension of files to be searched for:" );
String ext = new BufferedReader( new InputStreamReader( System.in ) ).readLine( );
SimpleLocalDriveSearch slds = new SimpleLocalDriveSearch( );
File[ ] roots = File.listRoots( );
for ( int i = 0; i < roots.length; i++ ) {
List found = slds.search( roots[ i ], ext );
if ( found.size( ) > 0 )
for ( Iterator iter = found.iterator( ); iter.hasNext( ); )
System.out.println( iter.next( ) );
else
System.out.println( "No match on " + roots[ i ] );
}
}
public class chengfabiao {
public static void main(String[] args) {
int[][] i=new int[9][9];
for(int i1=1;i1<=9;i1++){
for(int j=1;j<=i1;j++){
int s ;
s=j*i1;
System.out.print(i+"*"+j+"="+s+"\t");
}
System.out.println();
}
}
}
看一下图形样板