2
A
回答
13
public static void main(String[] args)
{
String string = "3 42 \n 11 \t 7 dsfss 365 \r 1";
String[] numbers = string.split("\\D+");
Arrays.sort(numbers, new Comparator<String>()
{
public int compare(String s1, String s2)
{
return Integer.valueOf(s1).compareTo(Integer.valueOf(s2));
}
});
System.out.println(Arrays.toString(numbers));
}
0
如果数字都是单个数字，则将字符串拆分为char数组并对数组进行排序。否则必须有一个分隔符来分隔数字。使用该分隔符调用string.split并对结果数组进行排序。排序功能是Arrays.sort（）如果没记错的话
Javadoc参考
http://java.sun.com/j2se/1.4.2/docs/api/java/lang/String.html#split%28java.lang.String%29 http://java.sun.com/javase/6/docs/api/java/util/Arrays.html#sort%28double[]%29
3
是相当病态的你的问题，但这里有几件事情，你应该知道：
- 有一个
Arrays.sort(Object[])，你可以用它来排序任意对象。 String的自然排序为lexicographic。- Java数组是协变的：a
String[]是Object[]。
因此，鉴于String[] sarr，如果你想字典顺序（即"1" < "10" < "2"），只需Arrays.sort(sarr);作品排序。字符串是否包含数字并不重要。
如果您想对字符串进行排序（如"1" < "2" < "10"），则需要将字符串转换为数字值。取决于这些数字的范围，Integer.parseInt可能会这样做;否则，您始终可以使用BigInteger。
我们假设需要BigInteger。
现在你有两个选择：
转换
String[]到BigInteger[]，则由于BigInteger implements Comparable<BigInteger>，您可以使用它的自然顺序使用Arrays.sort。然后，您可以将排序的BigInteger[]转换回String[]。将
String转换为BigInteger“适时”用于通过自定义Comparator<String>进行比较。由于Arrays.sort使用基于比较的mergesort，因此可以预期O(N log N)比较，因此可以进行多次转换。
14
一个通用的解决方案是使用所谓的“自然顺序比较器”。
下面是一个例子：
http://pierre-luc.paour.9online.fr/NaturalOrderComparator.java
自然顺序实际上是在情况很重要，因为一个字符串可能包含数字的运行和你想要的东西，按字母顺序上的字母，但数字排序的数字。例如，Windows资源管理器的现代版本使用它来排序文件名。根据版本字符串选择最新版本的库（即“1.2.3”与“1.20.1”相比）也非常方便。
如果你的字符串真的只包含数字（就像你放在描述中一样），那么你最好不要使用字符串 - 而是用Integer对象创建和使用。
注意：上面的链接似乎已被打破。该代码是非常有用，我要在这里发布：
/*
* <copyright>
*
* Copyright 1997-2007 BBNT Solutions, LLC
* under sponsorship of the Defense Advanced Research Projects
* Agency (DARPA).
*
* You can redistribute this software and/or modify it under the
* terms of the Cougaar Open Source License as published on the
* Cougaar Open Source Website (www.cougaar.org).
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* </copyright>
*/
/*
NaturalOrderComparator.java -- Perform 'natural order' comparisons of strings in Java.
Copyright (C) 2003 by Pierre-Luc Paour <[email protected]>
Based on the C version by Martin Pool, of which this is more or less a straight conversion.
Copyright (C) 2000 by Martin Pool <[email protected]>
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
package org.cougaar.util;
//CHANGES: KD - added case sensitive ordering capability
// Made comparison so it doesn't treat spaces as special characters
//CHANGES:
// set package to "org.cougaar.util"
// replaced "import java.util.*" with explicit imports,
// added "main" file reader support
import java.util.Comparator;
/**
* A sorting comparator to sort strings numerically,
* ie [1, 2, 10], as opposed to [1, 10, 2].
*/
public final class NaturalOrderComparator<T> implements Comparator<T> {
public static final Comparator<String> NUMERICAL_ORDER = new NaturalOrderComparator<String>(false);
public static final Comparator<String> CASEINSENSITIVE_NUMERICAL_ORDER = new NaturalOrderComparator<String>(true);
private final boolean caseInsensitive;
private NaturalOrderComparator(boolean caseInsensitive) {
this.caseInsensitive = caseInsensitive;
}
int compareRight(String a, String b) {
int bias = 0;
int ia = 0;
int ib = 0;
// The longest run of digits wins. That aside, the greatest
// value wins, but we can't know that it will until we've scanned
// both numbers to know that they have the same magnitude, so we
// remember it in BIAS.
for (;; ia++, ib++) {
char ca = charAt(a, ia);
char cb = charAt(b, ib);
if (!Character.isDigit(ca) && !Character.isDigit(cb)) {
return bias;
} else if (!Character.isDigit(ca)) {
return -1;
} else if (!Character.isDigit(cb)) {
return +1;
} else if (ca < cb) {
if (bias == 0) {
bias = -1;
}
} else if (ca > cb) {
if (bias == 0)
bias = +1;
} else if (ca == 0 && cb == 0) {
return bias;
}
}
}
public int compare(T o1, T o2) {
String a = o1.toString();
String b = o2.toString();
int ia = 0, ib = 0;
int nza = 0, nzb = 0;
char ca, cb;
int result;
while (true) {
// only count the number of zeroes leading the last number compared
nza = nzb = 0;
ca = charAt(a, ia);
cb = charAt(b, ib);
// skip over leading zeros
while (ca == '0') {
if (ca == '0') {
nza++;
} else {
// only count consecutive zeroes
nza = 0;
}
// if the next character isn't a digit, then we've had a run of only zeros
// we still need to treat this as a 0 for comparison purposes
if (!Character.isDigit(charAt(a, ia+1)))
break;
ca = charAt(a, ++ia);
}
while (cb == '0') {
if (cb == '0') {
nzb++;
} else {
// only count consecutive zeroes
nzb = 0;
}
// if the next character isn't a digit, then we've had a run of only zeros
// we still need to treat this as a 0 for comparison purposes
if (!Character.isDigit(charAt(b, ib+1)))
break;
cb = charAt(b, ++ib);
}
// process run of digits
if (Character.isDigit(ca) && Character.isDigit(cb)) {
if ((result = compareRight(a.substring(ia), b
.substring(ib))) != 0) {
return result;
}
}
if (ca == 0 && cb == 0) {
// The strings compare the same. Perhaps the caller
// will want to call strcmp to break the tie.
return nza - nzb;
}
if (ca < cb) {
return -1;
} else if (ca > cb) {
return +1;
}
++ia;
++ib;
}
}
private char charAt(String s, int i) {
if (i >= s.length()) {
return 0;
} else {
return caseInsensitive ? Character.toUpperCase(s.charAt(i)) : s.charAt(i);
}
}
}
+0
这特别适合用于人类消费的数据排序（尤其是如果将案例差异视为二阶差异），因为它产生的订单往往与非技术用户想象订购的工作方式相匹配。 – 2010-03-28 10:34:44
+0
链接被破坏，可以提供另一个链接 – sara 2013-01-28 10:58:00
+1
@sara代码张贴在上面。请享用。 – 2013-02-13 04:22:19
0
以“事”根据一些顺序排序的方式是创建知道一个比较，其中任何两件事情，首先根据顺序，或让“事物”本身实现Comparable接口，因此您不需要比较器。
如果你的工作是整理为整数，然后再考虑转换整数和然后排序为Integer类已经实现了媲美。
0
在Java 8中，我们有很好的解决方案
public static List<String> sortAsNumbers(Collection<String> collection) {
return collection
.stream()
.map(Integer::valueOf)
.sorted()
.map(String::valueOf)
.collect(Collectors.toList());
}
0
static final Comparator<Object> COMPARADOR = new Comparator<Object>() {
public int compare(Object o1, Object o2) {
double numero1;
double numero2;
try {
numero1 = Double.parseDouble(o1.toString());
numero2 = Double.parseDouble(o2.toString());
return Double.compare(numero1, numero2);
} catch (Exception e) {
return o1.toString().compareTo(o2.toString());
}
}
};
... 的ArrayList listaDeDatos; listaDeDatos.sort（COMPARADOR）;
相关问题
- 1. 对Java中包含数字的字符串进行排序
- 2. 如何对包含数字和字符的UTF-8字符串进行排序？
- 3. 使用数字对包含字符串的Arraylist进行排序
- 4. 对包含文本和数字的字符串进行排序
- 5. 通过包含数字对字符串数组进行排序？
- 6. 在bash中，如何对包含数字的字符串进行排序？
- 7. Java：按字符串中包含的数字对字符串列表进行排序（降序）
- 8. 如何对包含数字的字符串集合进行排序？
- 9. 如何对java中的字母数字字符进行排序？
- 10. 如何对包含数字，字符，字符的varchar列（SQL）进行排序？
- 11. 在SQL中对包含数字的字符串列进行排序？
- 12. 在MSSQL中对包含数字的字符串列进行排序？
- 13. 如何排序包含数字的字符串数组，数字
- 14. 根据字符串中的数字对字符串进行排序Java
- 15. 如何在java中对字符串数组进行排序？
- 16. 如何对包含数值的非均匀字符串进行排序？
- 17. 如何对字符串中的字符进行排序？
- 18. 排序与字符串包含数字
- 19. 按字符串中包含的整数值对数组进行排序
- 20. 如何对C中数组中的字符串进行排序？
- 21. 如何对字母数字字符串值进行排序？
- 22. Postgresql函数对字符串中的字符进行排序
- 23. 对字符串中的字符进行排序的C程序
- 24. 对Swift 3中包含日期的字符串数组进行排序？
- 25. 对字符串数组进行排序
- 26. 对字符串数组进行排序
- 27. 按字符串中的数字对数组进行排序？
- 28. Array.Sort如何对包含字符串和双精度的类进行排序？
- 29. 如何对包含嵌套JSON字符串的NSSArray进行排序？
- 30. 如何对包含python中的字母和数字的csv列进行排序？
为什么不从一开始就使用'Integer'而不是'String'？ – BalusC 2010-03-27 12:45:55