- 博客(8)
- 收藏
- 关注
RSS订阅原创 折半查找
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
257
原创 公约数
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
194
原创 逆序
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
253
原创 数组鞍点：行最大，列最小，只有一个
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
1019
原创 java 方阵
import java.util.Scanner; public class matrix { public static void main(String[] args) { Scanner reader=new Scanner(System.in); int n=reader.nextInt(); matrix ma=new matrix(); ma.
2012-08-08 20:28:57
373
原创 金额中文大写。。。细节有待完善
import java.util.StringTokenizer; public class moneyCap { private final static String[] pattern = { "零", "壹", "贰", "叁", "肆", "伍", "陆", "柒", "捌", "玖" }; private final static String[] cPattern =
2012-08-08 19:33:03
256
原创 杨辉三角
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
163
原创 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
213
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人