forked from damaohongtu/JavaInterview
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain_1.java
More file actions
67 lines (63 loc) · 1.73 KB
/
Main_1.java
File metadata and controls
67 lines (63 loc) · 1.73 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package BiShi.ByteDance;
import java.io.File;
import java.util.Arrays;
import java.util.Scanner;
/**
* @Author MaoTian
* @Classname Main_1
* @Description TODO
* @Date 下午4:53 2019/9/14
* @Version 1.0
* @Created by mao<[email protected]>
*/
public class Main_1 {
public static int check(int a,int b,int c){
if((b-a)<=10 && (c-b)<=10){
return 0;
}else if((b-a)>10 && (b-a)<=20 || (b-a)<=10 && (c-b)>10){
return 1;
}else {
return 2;
}
}
public static void main(String[] args)throws Exception {
Scanner sc =new Scanner(new File("/home/mao/workspace/面试/JavaGuide/JavaInterview/java/src/BiShi/ByteDance/main_1"));
//Scanner sc =new Scanner(System.in);
while(sc.hasNext()){
int n=sc.nextInt();
int[] nums=new int[n];
for (int i=0;i<n;i++){
nums[i]=sc.nextInt();
}
Arrays.sort(nums);
int count=0;
int post=0;
for (int i = 0; i <n-2 ; ) {
int a=nums[i];
int b=nums[i+1];
int c=nums[i+2];
int tmp=check(a,b,c);
if(tmp==0){
i=i+3;
}else if(tmp==1){
count++;
i=i+2;
}else{
count+=2;
i=i+1;
}
post=i;
}
if(post==n-2){
int a=nums[n-2];
int b=nums[n-1];
if((b-a)<=20){
count++;
}else{
count+=4;
}
}
System.out.println(count);
}
}
}