解题思路:
注意事项:
参考代码:
package Fifteen;
import java.util.Scanner;
public class 奇数单增序列 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int [] a=new int[n];
int [] b=new int[n];int z=0;
for (int i = 0; i < n; i++) {
a[i]=sc.nextInt();
if(a[i]%2==1)
{ b[z]=a[i];
z++;
}
}
int t;
for (int i = 0; i <z-1 ; i++) {
for (int j = 0; j <z-1-i; j++) {
if(b[j]>b[j+1])
{t=b[j];
b[j]=b[j+1];
b[j+1]=t;}
}
}
for (int i = 0; i < z; i++) {
if(i==z-1)
System.out.print(b[i]);
else
System.out.print(b[i]+",");
}
}
}
0.0分
1 人评分