Java-如何在不扩展比较器的情况下对包含句点/点的字符串数组进行排序? [英] Java- How to sort an array of strings that contain periods / dots without extending comparator?
本文介绍了Java-如何在不扩展比较器的情况下对包含句点/点的字符串数组进行排序?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
Java noob在这里.我想对包含从最小到最大的句点/点的字符串数组进行排序.
Java noob here. I want to sort an array of strings that contain periods / dots from smallest to largest.
因此包含以下内容的数组:
So an array containing:
1.0.3
1.0.12
1.0.2
排序不正确是这样的:
1.0.12
1.0.2
1.0.3
排序正确时应为:
1.0.2
1.0.3
1.0.12
这是我到目前为止的代码,但是它对它的排序不正确.
Here is the code I have so far, but it sorts it incorrectly.
public static String[] sort(String[] l) {
String[] ll=new String[l.length];
for(int i=0;i<l.length;i++)
{
}
for (int i = 0; i < l.length - 1; ++i) {
int minIndex = i;
for (int j = i + 1; j < l.length; ++j) {
if (l[j].compareTo(l[minIndex]) < 0) {
minIndex = j;
}
}
String temp = l[i];
l[i] = l[minIndex];
l[minIndex] = temp;
}
return l;
}
推荐答案
EDIT 完整,可运行的版本.
EDIT Complete, runnable version.
使用一个类,可能会更简单:
Using a class, it may be simpler:
public class Version implements Comparable<Version> {
public final int major;
public final Integer minor;
public final Integer patch;
public Version( String ver ) {
final String[] parts = ver.split("\\.");
this.major = Integer.parseInt( parts[0] );
if( parts.length > 1 ) {
this.minor = Integer.parseInt( parts[1] );
if( parts.length > 2 ) {
this.patch = Integer.parseInt( parts[2] );
}
else {
this.patch = null;
}
}
else {
this.minor = null;
this.patch = null;
}
}
@Override
public int compareTo( Version right ) {
int diff = this.major - right.major;
if( diff != 0 ) {
return diff;
}
if( this.minor == null && right.minor == null ) {
return 0;
}
if( this.minor == null && right.minor != null ) {
return -1;
}
if( this.minor != null && right.minor == null ) {
return +1;
}
diff = this.minor - right.minor;
if( diff != 0 ) {
return diff;
}
if( this.patch == null && right.patch == null ) {
return 0;
}
if( this.patch == null && right.patch != null ) {
return -1;
}
if( this.patch != null && right.patch == null ) {
return +1;
}
diff = this.patch - right.patch;
return diff;
}
@Override
public String toString() {
return String.format( "%d.%d.%d", major, minor, patch );
}
public static void main( String[] args ) {
final List<Version> versions = new ArrayList<>( 20 );
versions.add( new Version( "5.3" ));
versions.add( new Version( "5.3.0" ));
versions.add( new Version( "2.5" ));
versions.add( new Version( "2.5.100" ));
final Random r = new Random( System.currentTimeMillis());
for( int i = 0; i < 20; ++i ) {
final int maj = r.nextInt( 10 );
final int min = r.nextInt( 10 );
final int pat = r.nextInt( 100 );
final Version v =
new Version( String.format( "%d.%d.%d", maj, min, pat ));
versions.add( v );
}
Collections.sort( versions );
versions.forEach( System.err::println );
}
}
执行跟踪:
0.5.55
0.9.54
1.1.60
1.7.19
1.8.15
2.2.85
2.5.null
2.5.100
2.7.68
2.8.42
3.1.57
3.2.50
4.4.18
5.3.null
5.3.0
6.3.0
7.1.26
7.2.30
7.4.47
7.5.63
7.6.13
8.6.12
8.9.80
9.8.4
这篇关于Java-如何在不扩展比较器的情况下对包含句点/点的字符串数组进行排序?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文