- 排序
冒泡排序
import java.util.Scanner ;
public class Test{
public static void main(String args[]){
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 ; i++){ //把接受到的数组,进行冒泡排序
for(int j=0; j<a.length-i-1 ;j++)
if(a[j+1]<a[j]){
int temp = a[j] ;
a[j] = a[j+1] ;
a[j+1] = temp ; }
}
for(int i : a){
System.out.print(i+"、"); //循环输chu数据
}
}
}
选择排序
import java.util.Scanner;
public class SelectSort{
public static void main(String [] args){
Scanner sc = new Scanner(System.in) ; //接受键盘数据实例化对象,
int a[]=new int[10];
for(int i=0;i<a.length;i++)
a[i]=sc.nextInt();
int i,j;
for( i=0;i<a.length-1;i++){
int min=i;
for(j=i+1;j<a.length;j++)
if (a[j]<a[min]) min=j;
int temp=a[i];
a[i]=a[min];
a[min]=temp;
}
for(int x : a)
System.out.print(x+" ");
}
}
- for each
1.
public class ForEach {
public static void main(String[]args){
int [][]a={ {1,2,3} ,{4,5,6 } ,{7,8,9 } };
for(int []row:a){
for(int element:row)
System.out.print(element+"\t");
System.out.println();
}
}
}
2.
public class shuzu{
public static void main(String[] args) {
int i, j, sum = 0;
int a[][]=new int[3][3];
for (i = 0; i < 3; i++) {
for (j = 0; j < 3; j++) a[i][j] =2*(i+1)+j;
}
for (i = 0; i < 3; i++) {
for (j = 0; j < 3; j++)
System.out.print(a[i][j]+ "\t");
System.out.println();
}
for(i=0;i<3;i++)
sum=sum+a[i][a.length-i-1];
System.out.println(sum);
}
}
public class shuzu{
public static void main(String[] args) {
int i, j, sum = 0;
int a[][]=new int[3][3];
for (i = 0; i < 3; i++) {
for (j = 0; j < 3; j++) a[i][j] =2*(i+1)+j;
}
for (int[]x:a) { // for(int []i:a) for(int i=o;i<a.length;i++)
for (int y:x) // for(int j:i) for(int j=0;j<a[i].length;j++)
System.out.print(y+ "\t");
System.out.println();
}
for(i=0;i<3;i++)
sum=sum+a[i][a.length-i-1];
System.out.println(sum);
}
}
- Arrays类
- Arrays.sort(a); 快速排序
import java.util.Arrays;
public class ArraySort{
public static void main(String[] args) {
int[] a = {100, 34, 88, 6, 39, 5};
System.out.print("排序前的数组为: ");
System.out.println(Arrays.toString(a));
Arrays.sort(a);
System.out.print("排序后的数组为: ");
System.out.println(Arrays.toString(a));
}
}
2.Arrays查找
Arrays.binarySearch(a,value)
import java.util.Scanner;
import java.util.Arrays;
public class Arrayquery{
public static void main(String[] args) {
int[] a = {100, 34, 88, 6, 39, 5, 3 ,65, 33, 74};
Scanner scanner = new Scanner(System.in);
System.out.println("请输入搜索值: ");
int value = scanner.nextInt();
Arrays.sort(a);
int find = -1;
if((find = Arrays.binarySearch(a, value)) > -1)
System.out.println(value+"是数组中的第" + (find+1) + " 个元素");
else
System.out.println("数组中没有"+value);
}
}
二.ArrayList类
1.数组对象的 添加
2.数组对象的 删除
3.数组对象的 查找
import java.util.*;
public class ArrayListDelApp extends ArrayList{
public static void main(String[] args) {
ArrayListDelApp aList=new ArrayListDelApp();
aList.add("10");
aList.add("20");
aList.add("30");
aList.add("40");
aList.add("50");
System.out.println("aList列表中的数据为:");
Iterator it=aList.iterator();
while(it.hasNext()) System.out.print((String)it.next()+"\t");
Scanner scanner = new Scanner(System.in);
System.out.println("\n请输入要查找的数据");
String input = scanner.next();
int num=-1;
if((num = aList.indexOf(input))>-1)
System.out.println(input+"是aList中的第"+(num+1)+"个元素");
else
System.out.println("aList中不存在该对象");
aList.remove(2);
System.out.println("\n删除操作后,aList列表中的数据为:");
for(int i=0; i<aList.size(); i++) System.out.print(aList.get(i)+"\t");
aList.removeRange(0,2);
System.out.println("\n多删除操作后,aList列表中的数据为:");
for(int i=0; i<aList.size(); i++)
System.out.print(aList.get(i)+"\t");
}
}