Java中的数组

public classConutMark {

    public static void main(String[] args) {

         //定义二维数组

int grades[][] = { {77, 68, 86, 73 }, { 96, 87, 89, 81 }, { 70, 90, 86, 81 } };

int lowGrade =grades[0][0];        //定义保存最低分数的变量

for (int i = 0; i<grades.length; i++) {  //循环遍历数组

             for (int column = 0; column <grades[i].length; column++) {

                if (grades[i][column]<lowGrade)

                  //取数组中最小值赋予lowGrade变量

lowGrade =grades[i][column];        

             }

         }

inthighGrade =grades[0][0];      //定义保存最高分数的变量

for (int j = 0; j<grades.length; j++) {

for (int column =0; column < grades[j].length; column++) {

if(grades[j][column] >highGrade)

                     //取数组中最大值赋予highGrade变量

highGrade =grades[j][column]; 

             }

         }

System.out.println("最低的分数为：" +lowGrade);   //打印数组中最小值

System.out.println("最高的分数为：" +highGrade);   //打印数组中最大值

    }

}

public class TestDemo {

         public static voidmain(String args[]) {

                   int data [] = newint [] {209,201,2,2,3,6,7} ;

                   int searchData = 3;       // 要查找的内容

                   if(isExists(data,searchData)) {       // 为true

                            System.out.println("已经查找到了内容。") ;

                   } else {

                            System.out.println("没有找到内容。") ;

                   }

         }

         public staticbooleanisExists(int temp [],int search) {          //存在

                   for (int x = 0 ; x<temp.length ; x ++) {

                            if(temp[x] == search) {

                                     returntrue ;          // 查找到了，后面的循环不做了

                            }

                   }

                   return false ;        // 没有查找到

         }