All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.kovizone.poi.ooxml.plus.util.ArrayUtils Maven / Gradle / Ivy

The newest version!
package com.kovizone.poi.ooxml.plus.util;

import java.util.Arrays;

/**
 * 

数组工具

* * @author KoviChen * @version 1.0 */ public class ArrayUtils { /** *

数组叠加,去除空项

*
     *  String[] strArray1 = new String[]{"value1", null, "value2"};
     *  String[] strArray2 = new String[]{"value3", null, "value4"};
     *
     *  // {"value1", "value2", "value3", "value4"}
     *  String[] strArray3 = ArrayUtils.addTrimAll(strArray1, strArray2);
     * 
* * @param original 原数组 * @param array 叠加数组 * @param 泛型g * @return 新数组 */ public static T[] addTrimAll(T[] original, T[] array) { return trim(addAll(original, array)); } /** *

数组叠加

* *
     *  String[] strArray1 = new String[]{"value1", null, "value2"};
     *  String[] strArray2 = new String[]{"value3", null, "value4"};
     *
     *  // {"value1", null, "value2", "value3", null, "value4"}
     *  String[] strArray3 = ArrayUtils.addAll(strArray1, strArray2);
     * 
* * @param original 原数组 * @param array 叠加数组 * @param 泛型 * @return 新数组 */ public static T[] addAll(T[] original, T[] array) { if (array == null) { return original; } int newLength = original.length + array.length; T[] newArray = Arrays.copyOf(original, newLength); int i = original.length; for (T t : array) { newArray[i++] = t; } return newArray; } /** * 去掉数组中的空项 * *
     *  String[] strArray1 = new String[]{"value1", null, "value2"};
     *
     *  // {"value1", "value2"}
     *  String[] strArray2 = ArrayUtils.trim(strArray1);
     * 
* * @param original 数组 * @param 泛型 * @return 新数组 */ public static T[] trim(T[] original) { if (original == null) { return null; } int nullSize = 0; for (int i = 0; i < original.length; i++) { if (original[i] == null) { if (i < original.length - 1) { for (int j = i + 1; j < original.length; j++) { if (original[j] != null) { original[i] = original[j]; original[j] = null; break; } } if (original[i] == null) { nullSize++; } } else { nullSize++; } } } return Arrays.copyOf(original, original.length - nullSize); } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy