class Solution {
public static int thirdMax(int[] nums) {
int max1=-2147483648;
int max2=-2147483648;
int max3=-2147483648;
int flag=0;
for(int i=0;i<nums.length;i++){
if(max1<nums[i]){
max2=max1;
max1=nums[i];
}else if(max2<nums[i]){
if(max1!=nums[i]){
max2=nums[i];
}
}
}
for(int j=0;j<nums.length;j++){
if(nums[j]!=max1&&nums[j]!=max2) {
if (max3 <=nums[j]) {
max3 = nums[j];
flag = 1;
}
}
}
if(flag==1){
return max3;
}else{
return max1;
}
}
}