binarySearch要求字符串数组是有序的,不肯定是否有序的情况下还是自己写判断吧
仅仅是为了判断是否存在某个值,也没有必要首先排序吧。
比如:
public static final String[] TYPES = {
"Sedan",
"Compact",
"Roadster",
"Minivan",
"SUV",
"Convertible",
"Cargo",
"Others"
};
String carName = "SUV"; // 比如说SUV
int index = -1;
for (int i=0;i
index = i;
break;
}
}