• java Arrays工具类部分方法


     1         //Arrays.toString()
     2         int[] a = new int[]{1,2,3,4,5,6};
     3         System.out.println(a);
     4         System.out.println(a.toString());
     5         System.out.println(Arrays.toString(a));
     6 
     7         //Arrays.sort()
     8         int[] b = new int[]{6,3,7,1,3,8,4,3,0,3,2};
     9         System.out.println(Arrays.toString(b));
    10         Arrays.sort(b);
    11         System.out.println(Arrays.toString(b));
    12 
    13         //Arrays.binarySearch()
    14         int[] c = {18,62,68,82,65,9};
    15         Arrays.sort(c);
    16         System.out.println(Arrays.binarySearch(c,65));
    17 
    18         //Arrays.equals()
    19         int[] d = {18,62,68,82,65,9};
    20         int[] e = {18,62,68,82,65,9};
    21         int[] f = {18,62,68,82,65,8};
    22         System.out.println(Arrays.equals(d,e));
    23         System.out.println(Arrays.equals(d,f));
    24         System.out.println(Arrays.equals(e,f));
    25 
    26         //Arrays.fill()
    27         int[] g = new int[10];
    28         Arrays.fill(g,5);
    29         System.out.println(Arrays.toString(g));
    输出结果如下

    [I@1b6d3586 [I@1b6d3586 [
    1, 2, 3, 4, 5, 6] [6, 3, 7, 1, 3, 8, 4, 3, 0, 3, 2] [0, 1, 2, 3, 3, 3, 3, 4, 6, 7, 8] 3 true false false [5, 5, 5, 5, 5, 5, 5, 5, 5, 5]
  • 相关阅读:
    构建之法阅读笔记03
    构建之法阅读笔记02
    构建之法读书笔记01
    梦断代码读书笔记03
    背包九讲问题
    C-01背包问题
    C-最长回文子串(2)
    C-最长回文子串(1)
    C语言顺序栈实现
    带头结点头部插入创建链表
  • 原文地址:https://www.cnblogs.com/fanful/p/11639919.html
Copyright © 2020-2023  润新知