题解 Java| #KiKi去重整数并排序#
KiKi去重整数并排序
http://www.nowcoder.com/practice/f59b914172b94c69a2b29ad0a1d9b1a7
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner s = new Scanner(System.in);
nums[i] = s.nextInt();
}
for(int j=0;j<n-i-1;j++){
if(nums[j]>nums[j+1]){
int temp = nums[j];
nums[j] = nums[j+1];
nums[j+1] = temp;
}
}
}
if(nums[i]==nums[i+1]){
continue;
}
System.out.print(nums[i]+" ");
}
}
}
public class Main{
public static void main(String[] args){
Scanner s = new Scanner(System.in);
int n = s.nextInt();
// 数组容量+1，防止数组越界
int[] nums = new int[n+1];
// 用一维数组接收n个数
for(int i=0;i<n;i++){nums[i] = s.nextInt();
}
// 利用冒泡排序，对数组进行升序排列
for(int i=0;i<n-1;i++){for(int j=0;j<n-i-1;j++){
if(nums[j]>nums[j+1]){
int temp = nums[j];
nums[j] = nums[j+1];
nums[j+1] = temp;
}
}
}
// 遍历数组，输出不重复的数字
for(int i=0;i<n;i++){if(nums[i]==nums[i+1]){
continue;
}
System.out.print(nums[i]+" ");
}
}
}
SHEIN希音公司福利 310人发布