Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies如何按照從最長到最短的模式用 Java 來對字串陣列進行排序
首先，讓我們建立一個字串陣列
String[] strArr = { "ABCD", "AB", "ABCDEFG", "ABC", "A", "ABCDE", "ABCDEF", "ABCDEFGHIJ" }對於從最長到最短的模式，例如 ABCDEFGHIJ、ABCDEFG、ABCDEF 等等；獲取兩個字串陣列的長度，並按如下方式對它們進行處理
Arrays.sort(strArr, (str1, str2) → str2.length() - str1.length());
以下是用 Java 將字串陣列按照從最長到最短的模式進行排序的一個示例
示例
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 (longest to shortest) = ");
Arrays.sort(strArr, (str1, str2) → str2.length() - str1.length());
Arrays.asList(strArr).forEach(System.out::println);
}
}輸出
Sorting array on the basis of their lengths (longest to shortest) = ABCDEFGHIJ ABCDEFG ABCDEF ABCDE ABCD ABC AB A
更新於：2019 年 7 月 30 日
268 次瀏覽
廣告