题解 | #没有出现的编号#
没有出现的编号
https://www.nowcoder.com/practice/875d705df65c401a905f574070e09320
import java.util.*;
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param nums int整型一维数组
* @return int整型一维数组
*/
public int[] findMissingAndMaxNegative (int[] nums) {
// write code here
int[] res = new int[2];
Arrays.sort(nums);
if(nums[0] >= 0){
res[1] = 0;
}else if(nums[nums.length -1] < 0){
res[1] = nums[nums.length -1];
}else{
for(int i = 1;i < nums.length;i++){
if(nums[i]>=0){
res[1] = nums[i - 1];
break;
}
}
}
int missing = 1;
for(int i = 1;i < nums.length;i++){
if(nums[i]>0){
if(nums[i] != missing){
res[0] = missing;
break;
}else{
missing++;
}
}
}
res[0] = missing;
return res;
}
}
