Java基础学习day7【谷】
练习:
public class demo1 {
public static void main(String[] args) {
int sum=0;
int[][] arr1 = new int[][]{{3,5,8},{12,9},{7,0,6,4}};
for (int i = 0; i < arr1.length; i++) {
for (int j = 0; j < arr1[i].length; j++) {
sum+=arr1[i][j];
}
}
System.out.println(sum);
}
}
int[] y[]是二维数组
int x[] int[] x 是一维数组
int[][] y int y[][] 是二维数组
public class YangHui {
public static void main(String[] args) {
int[][] yh =new int[10][];
for (int i = 0; i < yh.length; i++) {
yh[i]=new int[i+1];
yh[i][0]=1;
yh[i][i]=1;
System.out.print(yh[i][0]+"\t");
for (int j = 1; j < yh[i].length-1; j++) {
yh[i][j] = yh[i - 1][j - 1] + yh[i - 1][j];
System.out.print(yh[i][j]+"\t");
}
if(i>0){
System.out.print(yh[i][yh[i].length-1]+"\t");
}
System.out.println();
}
}
}
数组中涉及的算法
练习
定义一个it型的一维数组,包含10个元素,分别赋一些随机整数,
然后求出所有元素的最大值,最小值,和值,平均值,并输出出来。
要求:所有随机数都是两位数。
public class Demo2 {
public static void main(String[] args) {
int[] array = new int[10];
int sum= 0;
int max= 0;
for (int i = 0; i < array.length; i++) {
array[i]=(int) (Math.random()*(99-10+1)+10);
sum+=array[i];
System.out.print(array[i]+"\t");
}
System.out.println();
int min= array[0];
for (int i = 0; i < array.length; i++) {
if(array[i]>max){
max=array[i];
}
}
for (int i = 0; i < array.length; i++) {
if(array[i]<min){
min=array[i];
}
}
double avg=(double)sum/array.length;
System.out.println("最大值为 "+max);
System.out.println("最小值为 "+min);
System.out.println("总数为 "+sum);
System.out.println("平均数为 "+avg);
}
}
数组的赋值与反转
- 因为数组是通过地址来指定堆内存的数组,所以不可以直接通过等号,要用for循环进行依次赋值
public class Demo3 {
public static void main(String[] args) {
String[] word=new String[]{"AA","BB","CC","DD","EE","FF"};
//数组的复制
String word1[]=new String[word.length];
for (int i = 0; i < word.length; i++) {
word1[i]=word[i];
System.out.print(word1[i]+"\t");
}
System.out.println();
//数组的反转
//方法一:
/* for (int i = 0; i < word1.length/2; i++) {
String temp=word1[i];
word1[i]=word1[word1.length-i-1];
word1[word1.length-i-1]=temp;
}*/
//方法二
for(int i=0,j= word1.length-1;i<j;i++,j--){
String temp=word1[i];
word1[i]=word1[j];
word1[j]=temp;
}
for (int i = 0; i < word1.length; i++) {
System.out.print(word1[i]+"\t");
}
}
}
顺序查找
public class Demo4 {
public static void main(String[] args) {
String[] word=new String[]{"AA","BB","CC","DD","EE","FF"};
Scanner sc = new Scanner(System.in);
String s = sc.next();
boolean isFlag=false;
for (int i = 0; i < word.length; i++) {
if(word[i].equals(s)){
isFlag=true;
System.out.println("找到了,位置在: "+i);
break;
}
}
if(isFlag==false){
System.out.println("没有找到欸!!!");
}
}
}
二分法
前提必须在有序数组中才可以使用
public class Demo5 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] word=new int[]{-88,-77,-59,-21,0,1,55,88,96};
boolean isFlag=true;
int head=0;
int end= word.length-1;
int a = sc.nextInt();
while(isFlag){
int middle=(end+head)/2;
if(a==word[middle]){
System.out.println("找到了,位置在: "+middle);
isFlag=false;
break;
}else if(a>word[middle]){
head=middle+1;
}else {
end=middle-1;
}
}
if(isFlag){
System.out.println("没有找到欸!!!");
}
}
}
十大内部排序算法
- 选择排序
- 直接选择排序 堆排序
- 交换排序
- 冒泡排序、快速排序
- 插入排序
- 直接插入排序、折半插入排序、Shell排序
- 归并排序
- 桶式排序
- 基数排序
冒泡排序
//冒泡排序
public class Demo6 {
public static void main(String[] args) {
int[] word = new int[]{9, 4, 2, 7, 0, 8, 66, 545, -99, -4};
for (int i = 0; i < word.length; i++) {
for (int j = 0; j < word.length-1-i; j++) {
if(word[j]>word[j+1]){
int temp=word[j];
word[j]=word[j+1];
word[j+1]=temp;
}
}
}
for (int i = 0; i < word.length; i++) {
System.out.print(word[i]+"\t");
}
}
}
数组工具类
java.util.Arrays类即为操作数组的工具类,包含了用来操作数组(比如排序和搜索)的各种方法
import java.util.Arrays;
public class Demo7 {
public static void main(String[] args) {
int[] a = new int[]{1,2,3,4};
int[] b = new int[]{1,4,2,3};
int[] word = new int[]{9, 4, 2, 7, 0, 8, 66, 545, -99, -4};
boolean b1 = Arrays.equals(a, b);
System.out.println(b1);
System.out.println(Arrays.toString(word));
Arrays.fill(b,888);
System.out.println(Arrays.toString(b));
Arrays.sort(word);
System.out.println(Arrays.toString(word));
int index = Arrays.binarySearch(a, 3);
System.out.println(index);
}
}
数组中常见异常
数组索引越界异常
空指针异常