Question

JAVA编程题: 输入10个整数,对他们做升序,降序排序,求最大值,并查找值为100的数有几个(提示:可利用函数）

Answer 1

因为数据比较简单才10个，所以没必要弄那么多算法。而且要求也可以出现函数。代码如下。
public static void main(String [] args){
Scanner scanner=new Scanner(System.in);
List<Integer> numList=new ArrayList<Integer>();
int i=0;
while(i<10){ //输入10个数
System.out.println("请输入整数:");
Integer num=scanner.nextInt();
numList.add(num);
i++;
}
//升序

System.out.println("升序:");
Collections.sort(numList);
for(Integer n:numList){
System.out.print(n + " ");
}
//倒序

System.out.println("倒序:");
Collections.reverse(numList);
for(Integer n:numList){
System.out.println(n + " ");
}
//出现次数

int cxTimes=0;
for(Integer n:numList){
if(n==100){
cxTimes++;
}
}
System.out.println("100出现次数:"+cxTimes);
}

Answer 2

package com.longtime.test;
public class TestNum {
public static void main(String[] args) {
TestNum testNum = new TestNum();
int[] arr = new int[] { 3, 22, 11, 5, 100, 99, 20, 22, 5 };
testNum.sort(arr);
testNum.theBiggest(arr);
testNum.hundredNum(arr);
}
// 降序
public void sort(int[] targetArr) {
int temp = 0;
for (int i = 0; i < targetArr.length; i++) {
for (int j = i; j < targetArr.length; j++) {
if (targetArr[i] < targetArr[j]) { // 升序只要把 > 改成 <
temp = targetArr[i];
targetArr[i] = targetArr[j];
targetArr[j] = temp;
}
}
}
for (int i : targetArr) {
System.out.print(i + ",");
}
System.out.println();
}
public void theBiggest(int[] targetArr) {
int biggest = targetArr[0];
for (int i = 0; i < targetArr.length; i++) {
if (biggest < targetArr[i]) {
biggest = targetArr[i];
}
}
System.out.println("The biggest : " + biggest);
}
public void hundredNum(int[] targetArr){
int count = 0;
for(int i = 0 ; i< targetArr.length ; i++){
if(targetArr[i] == 100){
++count;
}
}
System.out.println("The num is 100 : " + count);
}
}

Answer 3

用数组做。。最简单的冒泡排序就OK了 。。至于查找。。。最普通的查找也行。。也可以二分查找。。这些网上都有的。。。慢慢看 你行的