双层for循环
package javaseday03;
import java.util.Scanner;
import org.junit.Test;
public class doublefor {
九九乘法表
/**
* 11=1 12=2 22=4 …
*
*
*
*
* 19=9 … 9*9=81
*/
@Test
// 双层for循环
public void myTest01() {
for (int i = 1; i <= 90; i++) {// 外层
for (int j = 1; j <= i; j++)// 内层
{
int sum = i * j;
System.out.print(j + "*" + i + "=" + sum + " ");
}
System.out.print("\n");
}
}
循环的中断break—> game over—>循环彻底终止
continue—>这次不行,进行下一次—>跳过当前本次,执行下一次
1-100之间的数累加,加到666终止打印1-***的和大于等于666
@Test
public void myTest02() {
int sum = 0;
for (int i = 0; i <= 100; i++) {
sum += i;
if (sum >= 666)
System.out.println("sum=" + sum);
System.out.println("1到"+i+"的和大于等于666");
break;
}
}
@Test
public void myTest03() {
//求1-100之间的偶数和
for(int i=0;i<=100;i++)
{
if(i==5)
{
continue;
}
System.out.println(i);
}
}
@Test
public void test04(){
outer: for (int i = 0; i < 10; i++) {
System.out.println("外层"+i);
inner: while (true) {//给循环加标签
Scanner sc = new Scanner(System.in);
System.out.println("请输入:");
String s = sc.next();
System.out.println("里层:" + s);
if (s.equals("hello"))
break inner;
if (s.equals("kitty"))
break outer;
}
}
}
@Test
public void test05(){
label1: for (int i = 0; i < 10; i++) {
System.out.print("\n");
for (int j = 0; j < 10; j++) {
System.out.print(j + " ");
if (j == 5) {
continue label1;
}
}
}
}
求9和12的最大公约数
@Test
public void test06(){
for(int i=9;i>=1;i--)
{
if(9%i==0&&12%i==0)
{
System.out.println(i+"是最大公约数");
break;
}
}
}
从1-100报数 逢7和7的倍数跳过
@Test
public void test07(){
for(int i=1;i<=100;i++)
{
//个位上是7或者十位是7或者被7整除
if(i%7==0||i/1%10==7||i/10%10==7)
{
System.out.println("应该跳过:"+i);
continue;
}
System.out.println("应该报:"+i);
}
}
百元百鸡问题
母鸡3元一只i,公鸡4元/只j,小鸡0.5/只花费100元买100只,每一只鸡可以买多少只,多少种可能
@Test
public void test08(){
double sum=0;
for(int i=0;i<=34;i++)
{
for(int j=0;j<=25;j++)
{
int k=100-i-j;
sum=3*i+4*j+0.5*k;
if(sum==100)
{
System.out.println("买"+i+"只母鸡"+" "+"买"+j+"只公鸡"+" "+"买"+k+"只小鸡");
}
}
}
}
}
数组
package javaseday03;
import org.junit.Test;
一维数组的定义
一维数组的初始化
数组元素的访问
数据属性length
数据的异常
冒泡排序
数组的遍历
public class ArrayTest {
@Test
public void myTest01() {
// 数组是未来存一组相同类型的数据 他一旦定义长度,不能自动扩充
// 一维数据定义
int[] a;
int b[];
// 一维数组初始化
// 静态初始化+赋值
int[] a1 = { 1998, 1999, 2000 };
System.out.println(a1);
// 动态初始化,赋0
int b1[] = new int[4];
System.out.println(b1);
float[] c = new float[8];
// 给第4个元素赋值
c[3] = 1999;
// 下面这行会产生java.lang.ArrayIndexOutOfBoundsException异常,数组越界异常
c[5] = 1998;
System.out.println(c[3]);
}
空指针异常NullPointerException
@Test
public void myTest02() {
int[] c = null;
if (c != null) {
System.out.println(c[0]);
}
}
编写一个简单程序,要求数组长度为5,分别赋值10,20,30,40,50,在控制台输出该数组的值
@Test
public void myTest03() {
int a[] = new int[5];
for (int i = 0; i <= 4; i++) {
a[i] = (i + 1) * 10;
}
for (int i = 0; i <= 4; i++) {
System.out.println(a[i]);
}
}
@Test
public void myTest04() {
int array[] = new int[100];
int l = array.length;
// 获取数组长度
System.out.println(l);
}
求数组{1,-12,33,34,59}最大值最小值和
@Test
public void myTest05() {
int array[] = { 1, -12, 33, 34, 59 };
int l = array.length;
// 获取数组长度
int sum = 0, max = array[0], min = array[0];
for (int i = 0; i < l; i++) {
if (array[i] > max)
max = array[i];
if (array[i] < min)
min = array[i];
sum = sum + array[i];
}
System.out.println("最大值:" + max);
System.out.println("最小值:" + min);
System.out.println("和:" + sum);
}
冒泡排序
@Test
public void myTest06() {
int array[] = { 1, -12, 33, 34, 59 };
// 获取数组长度
int l = array.length;
for (int i = 1; i < l; i++)
for (int j = 0; j < l - i; j++) {
if (array[j] > array[j + 1]) {
int temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
System.out.println("排序完成");
for (int i = 0; i < l; i++) {
System.out.println(array[i]);
}
}
数组的复制和排序System.arraycopy(source,srcPos,dest,destPos,length)
@Test
public void myTest07() {
int aa[] = { 1, 2, 3, 4, 5 };
int bb[] = { 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 };
// src 源数组被复制的数组
// srcPos 开始处的索引
// dest 目标数组
// destPos 放到目标数组的初始位置
// length 复制几个
System.arraycopy(aa, 0, bb, 0, 5);
for (int i = 0; i < bb.length; i++) {
System.out.println(bb[i]);
}
}
已知两个一维数组{1,2,3,4,5}和{6,7,8}将两个一维数组合并成一个一维数组{1,2,3,4,5,6,7,8}
@Test
public void myTest08() {
int aa[] = { 1, 2, 3, 4, 5 };
int bb[] = { 6, 7, 8 };
int cc[] = new int[8];
System.arraycopy(aa, 0, cc, 0, 5);
System.arraycopy(bb, 0, cc, 5, 3);
for (int i = 0; i < cc.length; i++) {
System.out.println(cc[i]);
}
}
二维数组定义
@Test
public void myTest09() {
//静态定义和赋值
int aa[][]={{1,2,3},{1,3},{2,3,4}};
int []bb[]={{1,2,3},{1,3},{2,3,4}};
int [][]cc={{1,2,3},{1,3},{2,3,4}};
//动态赋值
int dd[][]=new int[3][3];
dd[0][0]=1;
dd[0][1]=2;
dd[0][2]=3;
dd[1][0]=1;
dd[1][2]=3;
dd[2][0]=2;
dd[2][1]=3;
dd[2][2]=4;
int ee[][] =new int [3][];
ee[0]=new int[]{1,2,3};
ee[1]=new int[]{2,3};
ee[2]=new int[]{2,3,4};
}
//二维数组遍历
@Test
public void myTest10() {
int ee[][] =new int [3][];
ee[0]=new int[]{1,2,3};
ee[1]=new int[]{2,3};
ee[2]=new int[]{2,3,4};
System.out.println("e的长度:"+ee.length);
for(int i=1;i<3;i++)
{
System.out.println("里层数组的长度为:"+ee[i].length);
for(int j=0;j<ee[i].length;j++)
{
System.out.println(ee[i][j]);
}
}
}
作业
package javaseday03;
import java.util.Scanner;
import org.junit.Test;
public class HomeWork {
1、从键盘输入两个数,求这两个数的最大公约数
@Test
public void myTest01() {
Scanner sc = new Scanner(System.in);
int a, b, c;
a = sc.nextInt();
b = sc.nextInt();
if (a > b) {
c = a;
a = b;
b = c;
}
for (int i = a; i > 0; i--) {
if (a % i == 0 && b % i == 0) {
System.out.println("最大公约数:" + i);
break;
}
}
}
2、从1-100报数,逢7和7的倍数跳过
@Test
public void myTest02() {
for (int i = 1; i <= 100; i++) {
if (i % 7 == 0 || i / 1 % 10 == 7 || i / 10 % 10 == 7) {
System.out.println(i + "应该跳过");
continue;
}
System.out.println(i + "应该输出");
}
}
3、百元百鸡问题母鸡3元/只i,公鸡4元/只j,小鸡0.5元/只,如果花100元钱买100只鸡,每一种鸡可以买0只,请问有哪些可能?(嵌套for)
@Test
public void myTest03() {
for (int i = 0; i <= 34; i++) {
for (int j = 0; j <= 25; j++) {
int k = 100 - i - j;
double sum = 3 * i + 4 * j + 0.5 * k;
if (sum == 100) {
System.out.println("买公鸡" + i + "只 " + "买母鸡" + j + "只 " + "买小鸡" + k + "只");
}
}
}
}
4、质数判断1-100
@Test
public void myTest04() {
System.out.println("1既不是质数也不是和数");
int s = 0;
for (int i = 2; i <= 100; i++) {
for (int j = 2; j < i; j++) {
if (i % j == 0) {
System.out.println(i + "是和数");
s = 1;
break;
}
}
if (s == 0) {
System.out.println(i + "是质数");
}
s = 0;
}
}
5、将一个字符数组的值(neusofteducation)拷贝到另一个字符数组中。
@Test
public void myTest05() {
String s="neusofteducation";
char ss[]=s.toCharArray();
char sss[]=new char[20];
System.arraycopy(ss, 0, sss,0 ,ss.length);
for(int i=0;i<sss.length;i++)
{
System.out.print(sss[i]);
}
}
6、给定一个有9个整数(1,6,2,3,9,4,5,7,8)的数组,先排序,然后输出排序后的数组的值。
@Test
public void myTest6() {
int a[] = { 1, 6, 2, 3, 9, 4, 5, 7, 8 };
for (int i = 1; i < a.length; i++) {
for (int j = 0; j < a.length - i; j++) {
if (a[j] > a[j + 1]) {
int s = a[j];
a[j] = a[j + 1];
a[j + 1] = s;
}
}
}
for (int i = 0; i < a.length; i++) {
System.out.println(a[i]);
}
}
7、在一个有8个整数(18,25,7,36,13,2,89,63)的数组中找出其中最大的数及其下标。
@Test
public void myTest7() {
int a[] = { 18, 25, 7, 36, 13, 2, 89, 63 };
int max = a[0], j = 0;
for (int i = 0; i < a.length; i++) {
if (a[i] > max) {
max = a[i];
j = i;
}
}
System.out.println("最大的数:" + max + " " + "下标:" + j);
}
8、将一个数组中的元素逆序存放。
@Test
public void myTest8() {
Scanner sc = new Scanner(System.in);
int a[] = new int[10];
int b[] = new int[10];
for (int i = 0; i < a.length; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < a.length ; i++) {
b[a.length-i-1]=a[i];
}
for (int i = 0; i < b.length; i++)
System.out.print(b[i]+" ");
}
9、将一个数组中的重复元素保留一个其他的清零。
@Test
public void myTest9() {
Scanner sc = new Scanner(System.in);
int a[] = new int[10];
for (int i = 0; i < a.length; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < a.length - 1; i++) {
for (int j = i+1; j < a.length; j++) {
if (a[i] == a[j]) {
a[j] = 0;
}
}
}
for (int i = 0; i < a.length; i++)
System.out.print(a[i]+" ");
}
10、给定一维数组{ -10,2,3,246,-100,0,5} ,计算出数组中的平均值、最大值、最小值。
@Test
public void myTest10() {
double a[] = { -10, 2, 3, 246, -100, 0, 5 };
double sum = 0, max = a[0], min = a[0];
for (int i = 0; i < a.length; i++) {
sum = sum + a[i];
if (max < a[i]) {
double s = a[i];
a[i] = max;
max = s;
}
if (min > a[i]) {
double s = a[i];
a[i] = min;
min = s;
}
}
System.out.println("平均值:" + sum / a.length);
System.out.println("最大值:" + max);
System.out.println("最小值:" + min);
}
}