如何按照最短到最長的模式用 Java 對字串陣列進行排序
首先,我們建立一個字串陣列
String[] strArr = { "ABCD", "AB", "ABCDEFG", "ABC", "A", "ABCDE", "ABCDEF", "ABCDEFGHIJ" };現在,針對最短到最長的模式(例如 A、AB、ABC、ABC 等),獲取兩個字串陣列的長度並按如下方式操作
Arrays.sort(strArr, (str1, str2) -> str1.length() - str2.length());
以下是一個按照最短到最長的模式對字串陣列排序的示例
示例
import java.util.Arrays;
public class Demo {
public static void main(String[] args) {
String[] strArr = { "ABCD", "AB", "ABCDEFG", "ABC", "A", "ABCDE", "ABCDEF","ABCDEFGHIJ" };
System.out.println("Sorting array on the basis of their lengths (shortest to longest) =");
Arrays.sort(strArr, (str1, str2) -> str1.length() - str2.length());
Arrays.asList(strArr).forEach(System.out::println);
}
}輸出
Sorting array on the basis of their lengths (shortest to longest) = A AB ABC ABCD ABCDE ABCDEF ABCDEFG ABCDEFGHIJ
廣告
資料結構
網路
關係型資料庫管理系統
作業系統
Java
iOS
HTML
CSS
Android
Python
C 程式設計
C++
C#
MongoDB
MySQL
Javascript
PHP