• 151009


    //数组
                             int myarry[] = new int [5];
                             
                             //初始化
                             int[] sh = {1,2,3};
                             
                             //索引是从0开始
                             
                             myarry[0] = 100;
                             myarry[2] = 200;
                             myarry[4] = 400;
                             
                             //初始化数组
                             
                             int my[] = new int[]{0,1,2,3,4};
                             for (int g = 0; g < myarry.length; g++)
                             {
                                 System.out.println("myarry = " + myarry[g]);
                             }
                             
                             char[] csz = new char[5];
                             
                             csz[0] =  'g';
                             
                             double[] dsz = {1,2,3};
                             
                             long lsz[] = new long[]{1,3,5,2};
                             
                             long l = lsz[2];
                             
                             //操作数组
                             Arrays.sort(lsz);//排序
                             
                             //遍历
                             
                             int n = 0;
                             while(n < lsz.length)
                             {
                                 System.out.println(" lsz{" + n + "] = " + lsz[n]);
                                 n++;
                             }
                             
                             //复制数组
                             long[] lsz2 = lsz;
                             
                             long[] lsz3 = Arrays.copyOf(lsz,2);
                             
                             long[] lsz4 = Arrays.copyOfRange(lsz, 1, 3);
                             
                             //查询数组,返回索引值
                             System.out.println("'8的索引位置 ="+Arrays.binarySearch(lsz, 8)) ;
                             
                             //填充
                             Arrays.fill(lsz2, 2);
                             
                             Arrays.fill(lsz3, 1,3,8);
                             
                             //foreach语句
                             
                             for(double d : dsz)
                             {
                                 System.out.println("d = " + d);
                             }
                             
                             //二维数组
                             int[][] ewsz = new int[2][3];
                             
                             ewsz[0] = new int[]{1,2,3};
                             ewsz[1] = new int[]{4,5,6};
                             
                             System.out.println("ewsz = " + ewsz[1][2]);
                             
                             System.out.println("ewsz = " + ewsz.length);
                             
                             for(int[] ie : ewsz)
                             {
                                 for(int f : ie)
                                 {
                                     System.out.print( f + " ");
                                 }
                                 
                                 System.out.println();
                             }
                             
                             for(int m = 0;m < ewsz.length; m++)//ewsz.length  数组的长度,其实就是行数长度
                             {
                                 for(int k = 0;k < ewsz[m].length; k++)//ewsz[m].length 数组里面的长度 相当于列数长度
                                 {
                                     System.out.print(ewsz[m][k]+" ");
                                 }
                                 System.out.println();
                             }
    //冒泡排序
            
            int[] sz = {23,12,56,97,19,30,7,21};
            
            for(int i : sz)
            {
                System.out.print(i + ",");
            }
            
            System.out.println();
            
            
            for (int j = 1; j < sz.length; j++)
            {
            for(int i = 0; i < sz.length - 1; i++)
                
                //改变排序方式
            {
                if(sz[i] > sz[i + 1])
                {
                    int t = sz[i + 1];
                    
                    sz[i + 1] = sz[i];
                    
                    sz[i] = t;
                }
            }
            for(int i : sz)
            {
                System.out.print(i+ ",");
            }
            System.out.println();
            }
  • 相关阅读:
    微软不也是从Altair Basic这丑小鸭长成白天鹅吗?
    互联网创业应该如何找到创意
    互联网创业创意养成记1
    安卓CTS官方文档之兼容性方案概览
    跨平台移动应用开发是否真的是一个好选择?
    Ubuntu安装MyEclise16 过程差不多
    Ubantu下安装jdk 教程
    最近出错总结
    使用Eclipse编译运行MapReduce程序 Hadoop2.6.0_Ubuntu/CentOS
    关于最近学习出现的错误,及解决的想法
  • 原文地址:https://www.cnblogs.com/zhuxiaolin/p/4864493.html
Copyright © 2020-2023  润新知