zoukankan      html  css  js  c++  java
  • JAVA 数组常用技巧

    1.  在Java中输出一个数组(Print an array in Java)

    int[] intArray = { 1, 2, 3, 4, 5 };
    String intArrayString = Arrays.toString(intArray);
      
    // print directly will print reference value
    System.out.println(intArray);
    // [I@7150bd4d
      
    System.out.println(intArrayString);
    // [1, 2, 3, 4, 5]
    View Code

    2. 从数组中创建数组列表(Create an ArrayList from an array

    String[] stringArray = { "a", "b", "c", "d", "e" };
    ArrayList<String> arrayList = new ArrayList<String>(Arrays.asList(stringArray));
    System.out.println(arrayList);
    // [a, b, c, d, e]
    View Code

    3. 检查数组中是否包含特定值(Check if an array contains a certain value)

    String[] stringArray = { "a", "b", "c", "d", "e" };
    boolean b = Arrays.asList(stringArray).contains("a");
    System.out.println(b);
    // true
    View Code

    4. 连接两个数组( Concatenate two arrays)

    int[] intArray = { 1, 2, 3, 4, 5 };
    int[] intArray2 = { 6, 7, 8, 9, 10 };
    // Apache Commons Lang library
    int[] combinedIntArray = ArrayUtils.addAll(intArray, intArray2);
    View Code

    5. 删除数组元素(Remove element of an array)

    int[] intArray = { 1, 2, 3, 4, 5 };
    int[] removed = ArrayUtils.removeElement(intArray, 3);
    //create a new array
    System.out.println(Arrays.toString(removed));
    View Code
  • 相关阅读:
    map-count
    map-count
    map-constructors
    map-constructors
    multiset-find
    multiset-find
    multiset-insert
    C++ string详解
    treap(树堆)
    程序设计语言的变革
  • 原文地址:https://www.cnblogs.com/101key/p/3325841.html
Copyright © 2011-2022 走看看