java
文章平均质量分 65
zhuyaho
这个作者很懒,什么都没留下…
展开
-
杨辉三角
import java.util.Scanner;public class PaTri { public static void main(String[] args){Scanner reader=new Scanner(System.in);int n=reader.nextInt();triangle(n); }public static void tri原创 2012-08-05 17:18:36 · 173 阅读 · 0 评论 -
Java程序设计基础
1.哥德巴赫猜想。import java.util.Scanner;public class Gold { public static void main(String[] args) { System.out.print("请重新输入一个大于2的整数:"); Scanner reader=new Scanner(System.in); int n=reader.next原创 2012-08-05 16:54:44 · 220 阅读 · 0 评论 -
数组鞍点:行最大,列最小,只有一个
import java.util.Scanner;public class saddle { public static void main(String[] args) { int n=4; Scanner reader=new Scanner(System.in); int[][] array=new int[n][n]; for(int原创 2012-08-08 22:01:01 · 1027 阅读 · 0 评论 -
金额中文大写。。。细节有待完善
import java.util.StringTokenizer;public class moneyCap { private final static String[] pattern = { "零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖" }; private final static String[] cPattern =原创 2012-08-08 19:33:03 · 267 阅读 · 0 评论 -
折半查找
public class binary { public static void main(String[] args) { int a=6; int[] b = {0,1, 2, 3,4,5,6,7,8,9}; binary bin=new binary(); bin.exist(a,b); } public void exist(int a,int[] b)原创 2012-08-10 21:41:43 · 265 阅读 · 0 评论 -
逆序
public class invert { public static void main(String[] args) { int[] array={1,2,3,4,5,6,7,8,9,10,11}; invert in=new invert(); in.invertArray(array); } public void invertArray(int array[]原创 2012-08-10 21:12:02 · 268 阅读 · 0 评论 -
公约数
import java.util.Scanner;public class factor { public static void main(String[] args) { int a; int b; System.out.println("请输入两个整数:"); Scanner reader=new Scanner(System.in); a=reader原创 2012-08-10 21:37:04 · 210 阅读 · 0 评论