我为HackerRank BigSorting写了一个scala解决方案,
并在某些测试用例中获得RuntimeException.我在scastie测试了输入,似乎问题是由一个非常长的字符串调用length()引起的,但同样的java solution没有问题,这是一个bug吗?
我的解决方案代码是:
object Solution {
def stringSort(x:String, y:String):Boolean = {
var result = true
if(x.length < y.length){
result = true
}else if(x.length > y.length){
result = false
}else{
var founded = false
var i = 0
while(i < x.length && !founded){
var xi = x.charAt(i)
var yi = y.charAt(i)
if(xi != yi){
result = xi < yi
founded = true
}
i += 1
}
}
result
}
def bigSort(unsorted:Array[String]):Array[String] = {
return unsorted.sortWith(stringSort)
}
def main(args: Array[String]) {
val sc = new java.util.Scanner (System.in);
var n = sc.nextInt();
var unsorted = new Array[String](n);
for(unsorted_i <- 0 to n-1) {
unsorted(unsorted_i) = sc.next();
}
print(bigSort(unsorted).mkString("\n"))
// your code goes here
}
}
例外是
java.lang.IllegalArgumentException: Maximum String literal length exceeded
at scala.tools.asm.ByteVector.putUTF8(ByteVector.java:213)
at scala.tools.asm.ClassWriter.newUTF8(ClassWriter.java:1114)
at scala.tools.asm.ClassWriter.newString(ClassWriter.java:1582)
at scala.tools.asm.ClassWriter.newConstItem(ClassWriter.java:1064)
at scala.tools.asm.MethodWriter.visitLdcInsn(MethodWriter.java:1187)
at scala.tools.asm.tree.LdcInsnNode.accept(LdcInsnNode.java:71)
at scala.tools.asm.tree.InsnList.accept(InsnList.java:162)
at scala.tools.asm.tree.MethodNode.accept(MethodNode.java:820)
at scala.tools.asm.tree.MethodNode.accept(MethodNode.java:730)
at scala.tools.asm.tree.ClassNode.accept(ClassNode.java:412)
...
java解决方案
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
String[] unsorted = new String[n];
for(int i = 0; i < n; i++) unsorted[i] = in.next();
Arrays.sort(unsorted,new Comparator<String>() {
@Override
public int compare(String a, String b)
{
return StringAsIntegerCompare(a,b);
}
});
StringBuilder output = new StringBuilder("");
for(String num : unsorted)
output.append(num+"\n");
System.out.println(output);
}
static int StringAsIntegerCompare(String s1, String s2)
{
if(s1.length() > s2.length()) return 1;
if(s1.length() < s2.length()) return -1;
for(int i = 0; i < s1.length(); i++)
{
if((int)s1.charAt(i) > (int)s2.charAt(i)) return 1;
if((int)s1.charAt(i) < (int)s2.charAt(i)) return -1;
}
return 0;
}
}
解决方法:
我可以看到Java和Scala代码之间的唯一重要区别是Scala sortWith创建了一个新数组,与Arrays.sort不同(并且可能还有一些中间开销),因此您可能会耗尽内存.你可以尝试
import scala.math.Ordering
import scala.util.Sorting
val byLength: Ordering[String] = ... // your implementation, similar to Java comparator
Sorting.quickSort(unordered)(byLength) // instead of sortWith, sorts in-place
有关相关文档,请参见http://www.scala-lang.org/api/2.12.0/scala/math/Ordering.html和http://www.scala-lang.org/api/2.12.0/scala/util/Sorting $.html.
原文地址:https://codeday.me/bug/20190622/1263689.html
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。