Java语言程序设计 第四版 第五章 课后习题

---

自己写的课后习题如有错误多多包涵

---

获得一个num1到num2之间随机数的方法(部分题目会使用)

	static int GetRandomNum(int num1,int num2)
	{
		int result=(int)(num1+Math.random()*(num2-num1+1));
		return result;
	}

5.1

		int a[]=new int[10];		//exercises 5.1
		int i,j,temb;
		for(i=0;i<a.length;i++)
		{
			a[i]=GetRandomNum(10,100);
		}
		System.out.println("排序前数组：");
		for(i=0;i<a.length;i++)
		{
			System.out.print(a[i]);
			System.out.print('\t');
		}
		for(i=0;i<a.length;i++)
		{
			for(j=i+1;j<a.length;j++)
			{
				if(a[i]>a[j])
				{
					temb=a[i];
					a[i]=a[j];
					a[j]=temb;
				}
			}
		}
		System.out.println("");
		System.out.println("排序后数组：");
		for(i=0;i<a.length;i++)
		{
			System.out.print(a[i]);
			System.out.print('\t');
		}

5.1(2)

		int a[]=new int[10];		//exercises 5.1(2)
		for(int i=0;i<a.length;i++)
		{
			a[i]=GetRandomNum(10,100);
		}
		System.out.println("排序前数组：");
		for(int v:a)//增强for循环输出数组
		{
			System.out.print(v);
			System.out.print('\t');
		}
		Arrays.sort(a);//从小到大排序数组
		System.out.println("");
		System.out.println("排序后数组：");
		for(int v:a)//增强for循环输出数组
		{
			System.out.print(v);
			System.out.print('\t');
		}

5.2

		Scanner sc=new Scanner(System.in);		//exercises 5.2
		int YanghuiTriangle[][];
		int n,i=0,j;
		System.out.print("请输入需要输出的杨辉三角的行数：");
		n=sc.nextInt();
		YanghuiTriangle=new int[n][];
		for(i=0;i<n;i++)
		{
			YanghuiTriangle[i]=new int[i+1];
			for(j=0;j<=i;j++)
			{
				if(j==0)YanghuiTriangle[i][j]=1;
				else if(j!=i)
				{
					YanghuiTriangle[i][j]=YanghuiTriangle[i-1][j-1]+YanghuiTriangle[i-1][j];
				}
				else
				{
					YanghuiTriangle[i][j]=1;
				}		
			}
		}
		for(i=0;i<YanghuiTriangle.length;i++)
		{
			for(j=0;j<YanghuiTriangle[i].length;j++)
			{
				System.out.print(YanghuiTriangle[i][j]);
				System.out.print('\t');
			}
			System.out.println("");
		}

5.3

		Scanner sc=new Scanner(System.in); //exercises 5.3
		int a[],i,j,k;
		a = new int[10];
		for(i=0; i<a.length;i++)
		{
			System.out.print("请输入第"+(i+1)+ "个元素");
			k = sc.nextInt();
			a[i] = k;
		}
		System.out.println("转换前数组为:");
		for(i=0; i<a.length;i++)
		{
			System.out.print(a[i]+" ");
		}
		System.out.println(" ");
		for(i=0,j=a.length-1;i<a.length;i++,j--)
		{
			k=a[i];
			a[i]=a[j];
			a[j]=k;
		}
		System.out.println("转换后数组为:");
		for(i=0;i<10;i++)
		{
			System.out.print(a[i]+" ");
		}

5.4

		Scanner sc=new Scanner(System.in);	//exercises 5.4
		int a[][];
		int i,j,m,n;
		System.out.println("请输入数组行数:");
		m=sc.nextInt();
		System.out.println("请输入数组列数:");
		n=sc.nextInt();
		a=new int[m][n];
		for(i=0;i<a.length;i++)
		{
			for(j=0;j<a[i].length;j++)
			{
				a[i][j]=GetRandomNum(10,99);
			}
		}
		System.out.println("输出数组");
		for(i=0;i<a.length;i++)
		{
			for(j=0;j<a[i].length;j++)
			{
				System.out.print(a[i][j]+" ");
			}
			System.out.println("");
		}
		m=0;n=0;
		for(i=0;i<a.length;i++)
		{
			for(j=0;j<a[i].length;j++)
			{
				if(a[m][n]>a[i][j])
				{
					m=i;
					n=j;
				}
			}
		}
		System.out.println("该数组最小元素为:"+a[m][n]);
		System.out.println("该元素所在行为:"+(m+1));
		System.out.println("该元素所在列为:"+(n+1));

5.5

	
Scanner sc=new Scanner(System.in);	//exercises 5.5
		int a[][],b[][];
		int i,j,m,n;
		System.out.println("请输入数组行数和列数:");
		m=sc.nextInt();
		n=sc.nextInt();
		a=new int[m][n];
		b=new int[n][m];
		for(i=0;i<a.length;i++)
		{
			for(j=0;j<a[i].length;j++)
			{
				a[i][j]=GetRandomNum(10,99);
			}
		}
		System.out.println("输出m行n列数组");
		for(i=0;i<a.length;i++)
		{
			for(j=0;j<a[i].length;j++)
			{
				System.out.print(a[i][j]);
				System.out.print('\t');
			}
			System.out.println("");
		}
		for(i=0;i<a.length;i++)
		{
			for(j=0;j<a[i].length;j++)
			{
				b[j][i]=a[i][j];
			}
		}
		System.out.println("输出转化后n行m列数组");
		for(i=0;i<b.length;i++)
		{
			for(j=0;j<b[i].length;j++)
			{
				System.out.print(b[i][j]);
				System.out.print('\t');
			}
			System.out.println("");
		}

5.6

		Scanner sc=new Scanner(System.in);	//exercises 5.6
		int n,i,j,LeftDiagonal=1,RightDiagonal=1;
		System.out.print("输入n ");
		n=sc.nextInt();
		int a[][]=new int[n][n];
		for(i=0;i<a.length;i++)
		{
			for(j=0;j<a[i].length;j++)
			{
				a[i][j]=GetRandomNum(1,9);
			}
		}
		for(i=0;i<a.length;i++)
			{
				for(j=0;j<a[i].length;j++)
				{
					System.out.print(a[i][j]);
					System.out.print('\t');
				}
				System.out.println("");
			}
		for(i=0;i<a.length;i++)
		{
			LeftDiagonal*=a[i][i];
			RightDiagonal*=a[i][a.length-1-i];
		}
		System.out.println("该数组主对角线之积为："+LeftDiagonal);
		System.out.println("该数组次对角线之积为："+RightDiagonal);

5.7

		int[][][] t = new int[2][2][3];		//exercises 5.7
        for (int i = 0; i < t.length; i++) {
            for (int j = 0; j < t[i].length; j++) {
                for (int k = 0; k < t[i][j].length; k++) {
                    t[i][j][k] =GetRandomNum(1,9);;
                }
            }
        }
        for (int i = 0; i < t.length; i++) 
        {
            for (int j = 0; j < t[i].length; j++)
            {
                System.out.println("t["+ i +"][" + j + "] = "+ Arrays.toString(t[i][j]));
            }
        }

5.8

        int a[]=new int[10];		//exercises 5.8
        int i,min=0,max=0;
        for(i=0;i<a.length;i++)
        	a[i]=GetRandomNum(1,90);
        System.out.println("输出数组");
        for(int j:a) 
        {
        	System.out.print(j);
        	System.out.print('\t');
        }
        for(i=0;i<a.length;i++)
        {
        	if(a[min]>a[i]) min=i;
        	if(a[max]<a[i]) max=i;
        }
        System.out.println("");
        System.out.println("该数组中的最大值为："+a[max]);
        System.out.println("该数组中的最小值为："+a[min]);
        System.out.println("该数组中的最大值与最小值的差值为："+(a[max]-a[min]));