- 数组
- 数组的应用:
- 查找
- 最值
- 作业
数组是什么?内存中一块连续的空间,数量是固定的,存储相同的数据类型;
特点:
长度:数组中最多可以存储几个数据。(几个连续的空间组成)
数组名:快速找到数组中存储的数据;
元素:数组中心存储的数据;
数组的数据类型:数组中存储数据的数据类型;
下标/索引lindex:数组名[下标] 取出数组中心存储的数据;范围[0,长度-1],超过范围可能引发数组 下标越界异常
数组的使用:
先声明,后开空间,再使用
声明数组:
数据类型[] 数组名;//推荐
数据类型 数组名[];
//声明数组-----告诉计算机数据类型 int[] nums; //推荐 String strs[];开空间—申请几个连续的空间
nums=new int[7]; strs=new String[3];//边声明,边开空间
char[] chs=new char[2];获取数组的长度
int len=chs.length;获取元素:数组名[下标]
系统会给数组分配默认值,int–0 double–0.0 boolean —false String–null(引用类型默认值)
int num=nums[0]; System.out.println(strs[2]);//ArrayIndexOutOfBoundsException存储数据–单个赋值
nums[0]=123;存储数据–多个赋值
//简便赋值的方法 int[] ns= {1,2,3,4,5}; //只能写在一行 char[] cs; cs= new char[]{'1','b'}; float[] fs=new float[] {1.3f,2.5f};存储数据–通过键盘输入赋值
Scanner input=new Scanner(System.in); for (int i = 0; i < nums.length ; i++) { System.out.print("请输入:"); nums[i]=input.nextInt(); }数组遍历
//for for (int i = 0; i < nums.length; i++){ System.out.print(nums[i]+" "); } //foreach 为遍历而生,不能修改 for (int n : nums) { //n=24; System.out.print(n+" "); }
练习:1、输入3个兴趣爱好,使用数组存储,并输出。
import java.util.Scanner;
public class Shuzu1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String[] num = new String[3];
for (int i = 0; i < num.length; i++) {
System.out.print("请输入爱好:");
num[i] = sc.next();
}
System.out.println("-----------------");
for (String m : num) {
System.out.print(m + " ");
}
}
}
*****null:引用类型特殊值;
数组的应用:数组的使用场合:多个相同数据类型数据的存储,为了更方便的操作(查找,排序,求最值)
查找 顺序查找
//查找 12,34,5,6,789,10 ------34 int[] nums= {12,34,5,6,789,10}; int n=35; boolean flag=false;//false不包含 true包含 for (int i = 0; i < nums.length; i++) { if(nums[i]==n) { flag=true; break; } }if(flag) { System.out.println("数列包含"+n); }else { System.out.println("数列不包含"+n); }
练习:查找指定姓名的学生
import java.util.Scanner;
public class Shuzhu3 {
public static void main(String[] args) {
String[] nums = {"1","2","3","王萌萌"};
Scanner sc = new Scanner(System.in);
System.out.print("请输入:");
String name = sc.next();
boolean flag = false;
for (int i = 0; i < nums.length; i++) {
if(nums[i].equals(name)){
flag = true;
break;
}
}
if(flag) {
System.out.println("数列包含"+name);
}else {
System.out.println("数列不包含"+name);
}
}
}
最值
public class Shuzu3 {
public static void main(String[] args) {
// 12,34,5,6,789,10
// num[i]>max max=num[i]
int[] nums = { 12, 34, 5, 6, 789, 10 };
int max = nums[0];
int len = nums.length;
for (int i = 1; i < len; i++) {
if (nums[i] > max) {//比较最大值
max = nums[i];
}
}
System.out.println("最大值:" + max);
System.out.println("===============");//分割线
int[] num = { 12, 34, 5, 6, 789, 10 };
int min = nums[0];
int leng = nums.length;
for (int i = 1; i < leng; i++) {
if (nums[i] < min) {//比较最小值
min = nums[i];
}
}
System.out.println("最小值:" + min);
}
}
作业
import java.util.Scanner;
public class GoHome {
public static void main(String[] args) {
int[] num = new int[6];//
int i = 0;
int sum = 0;
Scanner sc = new Scanner(System.in);
for (i = 0; i < num.length; i++) {
System.out.print("输入分数:");
num[i] = sc.nextInt();//输入分数
sum += num[i];
}
int pingJfen = sum / 6;// 平均分
int min = num[0];// 最低分
int len = num.length;
for (int j = 1; j < num.length; j++) {
if (min > num[j]) {//比较最低分
min = num[j];
}
}
System.out.println("平均分:" + pingJfen+"分");
System.out.println("最低分:" + min+"分");
}
}
import java.util.Scanner;
public class GoHome1 {
public static void main(String[] args) {
int[] num = { 8, 4, 2, 1, 23, 344, 12 };
int sum = 0;
Scanner sc = new Scanner(System.in);
int num1 = 0;
boolean flag = false;
for (int i = 0; i < num.length; i++) {
System.out.print(num[i] + "t");// 正序
sum += num[i];
}
System.out.println();
for (int i = num.length - 1; i >= 0; i--) {
System.out.print(num[i] + "t");
}
System.out.println();
System.out.println("所有数值的和为:" + sum);
System.out.print("请输入一个数字:");
num1 = sc.nextInt();
for (int i = 0; i < num.length; i++) {
if (num1 == num[i]) {
flag = true;
break;
}
}
if (flag) {
System.out.println("数列包含:" + num1);
} else {
System.out.println("不数列包含:" + num1);
}
}
}
public class GoHome2 {
public static void main(String[] args) {
int[] num = { 67, 90, -20, 105, 88, 92 };
for (int i = 0; i < num.length; i++) {
if(num[i]<0) {
num[i]=0;
}
if(num[i]>100) {
num[i]=100;
}
System.out.print(num[i]+"t");
}
}
}
public class GoHome3 {
public static void main(String[] args) {
int[] num = { 1, 3, 2, 45, 66, 7 };
int[] num1 = { 1, 3, 2, 45, 66, 8 };
int len = num.length;
int len1 = num1.length;
int count = 0;
if (len == len1) {
for (int i = 0, j = 0; i < num1.length; i++, j++) {
if (num1[i] == num[j]) {
count++;
}
}
if (count == len) {
System.out.println("相同");
} else {
System.out.println("不相同");
}
} else {
System.out.println("不相同");
}
}
}
public class GoHome4 {
public static void main(String[] args) {
int[] num = { 1, 2, 2, 2, 2, 2, 8, 8, 3 };
int len = num.length;
boolean flag = false;
if (len < 4) {
System.out.println("没有相同的数");
} else {
for (int i = 3; i < num.length; i++) {
if (num[i] == num[i - 1] && num[i - 1] == num[i - 2] && num[i - 2] == num[i - 3]) {
flag = true;
break;
}
}
if (flag) {
System.out.println("有相同的数");
} else {
System.out.println("没有相同的数");
}
}
}
}



