Java数组排序和查找

/**
* Created by Frank
*/
public class Array1 {
static Random r = new Random();
static char[] src = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz".toCharArray();

// Create a random String
public static String randString(int length) {
char[] buf = new char[length];
int rnd;
for (int i = 0; i < length; i++) {
rnd = Math.abs(r.nextInt()) % src.length;
buf[i] = src[rnd];
}
return new String(buf);
}

// Create a random array of Strings
public static String[] randStrings(int length, int size) {
String[] s = new String[size];
for (int i = 0; i < size; i++) {
s[i] = randString(length);
}
return s;
}

public static void print(byte[] b) {
for (byte aB : b) {
System.out.println(aB + " ");
}
System.out.println();
}

public static void print(String[] s) {
for (String value : s) {
System.out.print(value + " ");
}
System.out.println();
}

public static void main(String[] args) {
byte[] b = new byte[15];
r.nextBytes(b);
print(b);
java.util.Arrays.sort(b);
print(b);
int loc = Arrays.binarySearch(b, b[10]);
System.out.println("Location of " + b[10] + " = " + loc);
String[] s = randStrings(4, 10);
print(s);
Arrays.sort(s);
print(s);
loc = Arrays.binarySearch(s, s[4]);
System.out.println("Location of " + s[4] + " = " + loc);
}
}
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值