3 回答

TA貢獻1841條經驗 獲得超3個贊
請嘗試下面提到的解決方案。
String[] validOperators = {"+", "-", "/", "*", "=", "q", "Q"};
String userInput;
Scanner scanner = new Scanner(System.in);
Arrays.sort(validOperators);
do{
System.out.print("Please enter a valid operation ( +, -, /, *, = , q or Q ) to quit: ");
userInput = scanner.nextLine();
}while(Arrays.binarySearch(validOperators, userInput) <= -1);

TA貢獻1797條經驗 獲得超6個贊
我寧愿使用數組和流,從Java 8開始就可用。例如:
Arrays.stream(validOperators).anyMatch(userInput::equals)
如果你需要一個更好的性能解決方案來滿足一小部分元素,那么內存和進程都有效,并且不使用語法糖或Java 8流(而由于Vinod Singh Bist,循環更清晰,改進):
public static void main(String[] args) {
char[] validOperators = {'+', '-', '/', '*', '=', 'q', 'Q'}; // String is more expensive
char userInput;
Scanner scanner = new Scanner(System.in);
do{
System.out.print("Please enter a valid operation ( +, -, /, *, = , q or Q ) to quit: ");
userInput = scanner.next().charAt(0);
}while(!contains(validOperators, userInput)) ;
}
private static boolean contains(char[] elements, char c) {
// for loop is usually faster for small lists than any built-in iterator for primitives like char
for (int i = elements.length - 1; i >= 0; i--) {
if (elements[i] == c) {
return true;
}
}
return false;
}

TA貢獻1851條經驗 獲得超5個贊
Arrays.binarySearch(validOperators, userInput)
需要排序數組。
如果數組不是 ,則結果為 。你應該你sorted
undefined
Arrays.sort(validOperators);
添加回答
舉報