java做一个值日生表。要用到链表,random,list。一共十三个人,四个人一组,最后剩下一个自己一个集合。不能重复
2014-07-28 11:58
555 查看
package com.wanju.project001.zonghe.test;
import java.util.LinkedList;
import java.util.List;
import java.util.Random;
public class TestWork {
public static final int ALL_NUM = 13;
List<Student> ls = new LinkedList<Student>();
List<Student> lsForCopy = new LinkedList<Student>();
List<LinkedList<Student>> lss = new LinkedList<LinkedList<Student>>();
public void init() {
for (int i = 0; i < ALL_NUM; i++) {
Student s = new Student();
s.setNum(i);
s.setName("s" + i);
ls.add(s);
}
}
public static void main(String[] args) {
TestWork t = new TestWork();
t.init();
t.group();
t.show();
}
public void group() {
for (int i = 0; i < 4; i++) {
lss.add(new LinkedList<Student>());
}
boolean flg = true;
Random r = new Random();
StudentHelper helper = new StudentHelper(ls);
helper.setLsForCopy(lsForCopy);
for (int k = 0; k < 4; k++) {
for (int i = 0; i < 4; i++) {
while (flg) {
int v = r.nextInt(ls.size());
if (!helper.checkStudentByNum(v)) {
Student ss = helper.getStudentByNum(v);
lss.get(k).add(ss);
lsForCopy.add(ss);
helper.addLsForCopyStudent(ss);
if (lss.get(k).size() >= 4) {
flg = false;
}
if (k == 3) {
flg = false;
}
break;
}
}
}
flg = true;
}
}
public void show() {
for (int i = 0; i < lss.size(); i++) {
System.out.println(lss.get(i));
}
}
}
class Student {
private int num;
private String name;
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
@Override
public String toString() {
return "Student [num=" + num + ", name=" + name + "]";
}
}
class StudentHelper {
List<Student> ls = new LinkedList<Student>();
List<Student> lsForCopy = new LinkedList<Student>();
public List<Student> getLsForCopy() {
return lsForCopy;
}
public void setLsForCopy(List<Student> lsForCopy) {
this.lsForCopy = lsForCopy;
}
public void addLsForCopyStudent(Student s) {
lsForCopy.add(s);
}
public StudentHelper() {
}
public StudentHelper(List<Student> ls) {
this.ls = ls;
}
public Student getStudentByNum(int v) {
for (int i = 0; i < ls.size(); i++) {
if (ls.get(i).getNum() == v) {
return ls.get(i);
}
}
return null;
}
public boolean checkStudentByNum(int v) {
return getStudentByNumFromLsForCoby(v) == null ? false : true;
}
public Student getStudentByNumFromLsForCoby(int v) {
for (int i = 0; i < lsForCopy.size(); i++) {
if (lsForCopy.get(i).getNum() == v) {
return lsForCopy.get(i);
}
}
return null;
}
}
import java.util.LinkedList;
import java.util.List;
import java.util.Random;
public class TestWork {
public static final int ALL_NUM = 13;
List<Student> ls = new LinkedList<Student>();
List<Student> lsForCopy = new LinkedList<Student>();
List<LinkedList<Student>> lss = new LinkedList<LinkedList<Student>>();
public void init() {
for (int i = 0; i < ALL_NUM; i++) {
Student s = new Student();
s.setNum(i);
s.setName("s" + i);
ls.add(s);
}
}
public static void main(String[] args) {
TestWork t = new TestWork();
t.init();
t.group();
t.show();
}
public void group() {
for (int i = 0; i < 4; i++) {
lss.add(new LinkedList<Student>());
}
boolean flg = true;
Random r = new Random();
StudentHelper helper = new StudentHelper(ls);
helper.setLsForCopy(lsForCopy);
for (int k = 0; k < 4; k++) {
for (int i = 0; i < 4; i++) {
while (flg) {
int v = r.nextInt(ls.size());
if (!helper.checkStudentByNum(v)) {
Student ss = helper.getStudentByNum(v);
lss.get(k).add(ss);
lsForCopy.add(ss);
helper.addLsForCopyStudent(ss);
if (lss.get(k).size() >= 4) {
flg = false;
}
if (k == 3) {
flg = false;
}
break;
}
}
}
flg = true;
}
}
public void show() {
for (int i = 0; i < lss.size(); i++) {
System.out.println(lss.get(i));
}
}
}
class Student {
private int num;
private String name;
public int getNum() {
return num;
}
public void setNum(int num) {
this.num = num;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
@Override
public String toString() {
return "Student [num=" + num + ", name=" + name + "]";
}
}
class StudentHelper {
List<Student> ls = new LinkedList<Student>();
List<Student> lsForCopy = new LinkedList<Student>();
public List<Student> getLsForCopy() {
return lsForCopy;
}
public void setLsForCopy(List<Student> lsForCopy) {
this.lsForCopy = lsForCopy;
}
public void addLsForCopyStudent(Student s) {
lsForCopy.add(s);
}
public StudentHelper() {
}
public StudentHelper(List<Student> ls) {
this.ls = ls;
}
public Student getStudentByNum(int v) {
for (int i = 0; i < ls.size(); i++) {
if (ls.get(i).getNum() == v) {
return ls.get(i);
}
}
return null;
}
public boolean checkStudentByNum(int v) {
return getStudentByNumFromLsForCoby(v) == null ? false : true;
}
public Student getStudentByNumFromLsForCoby(int v) {
for (int i = 0; i < lsForCopy.size(); i++) {
if (lsForCopy.get(i).getNum() == v) {
return lsForCopy.get(i);
}
}
return null;
}
}
相关文章推荐
- Java判断一个值,或者对象是否存在list集合中和去掉list集合中重复的元素
- 果园里有一堆苹果,一共n头(n大于1小于9)熊来分,第一头为小东,它把苹果均分n份后,多出了一个,它扔掉了这一个,拿走了自己的一份苹果,接着第二头熊重复这一过程,即先均分n份,扔掉一个然后拿走一份,以此类推直到最后一头熊都是这样(最后一头熊扔掉后可以拿走0个,也算是n份均分)。问最初这堆苹果最少有多少个。
- 有n个人(1到n号)围成一个圈,从第1号按顺序报数(1-3),每报数为3的人从队伍去除,下个人继续从1开始报数,问最后剩下的那个人原来排在第几位- java
- Java基础知识强化之集合框架笔记35:List练习之产生10个1~20之间的随机数(要求:随机数不能重复)
- 关于Hibernate中fatch=eager的bag集合(一个java List)使用Criteria查询出现重复记录的问题
- 自己写了一个js,但是最终不能控制住最后后的提交,前面的还是比较完美,大家看到后,能帮我解决一下吗?
- Java中如何循环删除一个集合(如List)中的多个元素
- java中对list集合中的数据按照某一个属性进行分组
- java中去除List集合中重复数据的方法
- Java基础之集合框架——使用真的的链表LinkedList<>(TryPolyLine)
- List集合筛选数据去掉重复,含有数据重复次数(JAVAAndroid)
- java笔试题---程序产生一个int数组,长度为100,并向其中随机插入1-100,并且不能重复。
- java 中 各种集合(List Set Map) 去除重复项
- Java实现约瑟夫环:50个人围成一圈数数,数到3的人退出,求最后剩下的人的编号
- java——定义一个功能将ArrayList 集合中的重复元素删除(java集合七)
- Java中如何循环删除一个集合(如List)中的多个元素
- 自己写的一个有序链表的例子(Java)
- Java中如何循环删除一个集合(如List)中的多个元素
- 把两个List合并成一个List并且不能有重复
- 如何在Java中构建一个不包含重复元素的List