就是随即产生10个数 然后按顺序排列出来 随即产生的数不能有重复值 public class Test2 { /**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[]=new int[10];
Random r = new Random();
Set<Integer> t = new HashSet<Integer>();
for(int i=0;i<a.length;i++){
a[i]=r.nextInt(100);
t.add(a[i]);
Arrays.sort(a);
}
for(Iterator<Integer> it =t.iterator(); it.hasNext();){
System.out.println(it.next());
}
}
}
这样写 没有没有排序 知道的给我写个也行 谢谢了
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[]=new int[10];
Random r = new Random();
Set<Integer> t = new HashSet<Integer>();
for(int i=0;i<a.length;i++){
a[i]=r.nextInt(100);
t.add(a[i]);
Arrays.sort(a);
}
for(Iterator<Integer> it =t.iterator(); it.hasNext();){
System.out.println(it.next());
}
}
}
这样写 没有没有排序 知道的给我写个也行 谢谢了
int a[] = new int[10];
Random r = new Random();
Set<Integer> t = new TreeSet<Integer>();
for (int i = 0; i < a.length; i++) {
a[i] = r.nextInt(100);
t.add(a[i]);
}
for (Iterator<Integer> it = t.iterator(); it.hasNext();) {
System.out.println(it.next());
}
int a[] = new int[10];
Random r = new Random();
Set<Integer> t = new TreeSet<Integer>();
for (int i = 0; i < a.length; i++) {
a[i] = r.nextInt(100);
t.add(a[i]);
}
Arrays.sort(a);
for(int i:a)
System.out.println(i);
我的这个算法应该满足楼主的需求:
package api.ramdom;import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;public class TestSuiJi {
/**
* 随机产生10个互不相等的随机数,然后对其排序
*
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
// 1,随机产生10个互不相等的随机数,
Random random = new Random();
List<Integer> list = new ArrayList<Integer>();
for (int i = 0;; i++) {
Integer j = random.nextInt(10);
list.add(j);
if (list.size() > 1) {
for (int x = 0; x < list.size() - 1; x++) {
if (list.get(i) == list.get(x)) {
list.remove(i);
i--;
break;
}
}
}
if (list.size() == 10) {
break;
}
}
System.out.println(list); // 2,对这10个数进行排序,就很简单了,
// 3,升序
Collections.sort(list);
System.out.println(list);
// 4,降序,对这个list逆序输出便可,
for (int i = list.size() - 1; i >= 0; i--) {
System.out.print("[" + list.get(i) + " ]");
}
}}
for(int i = 0; i < 100; i++){
set.add(i);
} int[] n = new int[10];
int r = 0;
for(int i = 0; i < n.length; i++){
r = (int)(Math.random()*set.size());
n[i] = set.get(r);
set.remove(r);
}
for(int x : n){
System.out.print(x+" ");
}
import java.util.Random;
import java.util.Set;
import java.util.TreeSet;public class Test {
public static void main(String[] args) {
int a[] = new int[10];
Random r = new Random();
Set<Integer> t = new TreeSet<Integer>();
for (int i = 0;; i++) {
if (t.size() >= 10) {
break;
}
int num = r.nextInt(100);
if (!t.contains(num)) {
a[t.size()] = num;
t.add(a[t.size()]);
} }
for (Iterator<Integer> it = t.iterator(); it.hasNext();) {
System.out.println(it.next());
}
}
}
import java.util.Random;
import java.util.Set;
import java.util.TreeSet;public class Test {
public static void main(String[] args) {
int a[] = new int[10];
Random r = new Random();
Set<Integer> t = new TreeSet<Integer>();
for (int i = 0;; i++) {
if (t.size() >= 10) {
break;
}
int num = r.nextInt(100);
if (!t.contains(num)) {
a[t.size()] = num;
t.add(a[t.size()]);
} }
for (Iterator<Integer> it = t.iterator(); it.hasNext();) {
System.out.println(it.next());
}
}
}