forked from 1AvneetKaur/hacktoberfest2022-dsa
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMainakAndArray1.java
More file actions
49 lines (46 loc) · 1.34 KB
/
MainakAndArray1.java
File metadata and controls
49 lines (46 loc) · 1.34 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
import java.util.*;
public class MainakAndArray1{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
int t = scan.nextInt();
while (t-- >0)
{
int n = scan.nextInt();
int [] array = new int[n];
int [] array1 = new int[n];
int max =0;
int min = 999;
int maxIndex=-1;
int minIndex=-1;
for (int i=0;i<n;i++)
{
array[i] = scan.nextInt();
if(max<=array[i])
{
max = array[i];
maxIndex=i;
}
if(min>=array[i])
{
min = array[i];
minIndex=i;
}
}
if(minIndex==maxIndex+1 || minIndex==0 || maxIndex==n-1)
{
System.out.println(max-min);
}
else {
int diff=0;
for(int i=0;i<n-1;i++)
{
diff = Math.max(diff,array[i]-array[i+1]);
}
diff = Math.max(diff,max-array[0]);
diff = Math.max(diff,array[n-1]-min);
System.out.println(diff);
}
}
}
}