java实现出租车连号校验
时间: 2023-11-28 09:05:23 浏览: 95
您可以使用以下代码实现出租车连号校验:
```java
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int[] number = new int[N];
for (int i = 0; i < N; i++) {
number[i = in.nextInt();
}
int result = 0;
for (int i = 0; i < N; i++) {
int max = number[i];
int min = number[i];
for (int j = i; j < N; j++) {
max = Math.max(max, number[j]);
min = Math.min(min, number[j]);
if (max - min == j - i) {
result++;
}
}
}
System.out.println(result);
}
}
```
这段代码会先读取输入的出租车号码数量N,然后读取N个出租车号码,并对号码进行连号校验。最后输出符合条件的连号数量。请注意,该代码是使用简单的循环来实现连号校验的,没有使用jdk1.6及以上版本的特性。<em>1</em><em>2</em><em>3</em>
#### 引用[.reference_title]
- *1* [java实现第四届蓝桥杯连号区间数](https://blog.csdn.net/a1439775520/article/details/97654467)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}} ] [.reference_item]
- *2* [Java实现 蓝桥杯 历届试题 连号区间数](https://blog.csdn.net/a1439775520/article/details/97425988)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}} ] [.reference_item]
- *3* [Java习题练习:连号区间数](https://blog.csdn.net/m0_51456787/article/details/123580836)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT3_1"}} ] [.reference_item]
[ .reference_list ]
阅读全文
相关推荐














