循环链表:尾指针指向头
public class LinkedSinglyCircularList<E> implements List<E> {
//定义结点对象
private class Node{
E data; //数据域
Node next; //指针域
public Node(){
this(null,null);
}
public Node(E data){
this(data,null);
}
public Node(E data, Node next){
this.data = data;
this.next = next;
}
@Override
public String toString() {
return data.toString();
}
}
private Node head; //头指针
private Node tail; //尾指针
private int size; //元素个数
public LinkedSinglyCircularList(){
head = null;
tail = null;
size = 0;
}
public LinkedSinglyCircularList(E[] arr){
if (arr == null || arr.length == 0){
throw new IllegalArgumentException("arr is null");
}
for (int i =0; i < arr.length; i++){
add(arr[i]);
}
}
@Override
public void add(E element) {
add(size, element);
}
@Override
public void add(int index, E element) {
if (index < 0 || index > size){
throw new IllegalArgumentException("add index out of range");
}
//创建元素结点
Node n = new Node(element);
if (size == 0){
head = n;
tail = n;
tail.next = head;
}else if (index == 0){
n.next = head;
head = n;
tail.next = head;
}else if (index == size){
n.next = tail.next;
tail.next = n;
tail = n;
}else {
Node p = head;
for (int i = 0; i < index - 1; i++) {
p = p.next;
}
n.next = p.next;
p.next = n;
}
size++;
}
@Override
public void remove(E element) {
int index = indexOf(element);
if (index != -1){
remove(index);
}
}
@Override
public E remove(int index) {
if (index < 0 || index >= size){
throw new IllegalArgumentException();
}
E ret = null;
if (size == 1){
ret = head.data;
head = null;
tail = null;
}else if (index == 0){
Node n = head;
ret = n.data;
head = n.next;
n.next = null;
tail.next = head;
}else if (index == size - 1){
Node p = head;
while (p.next != tail){
p = p.next;
}
ret = tail.data;
p.next = tail.next;
tail = p;
}else {
Node p = head;
for (int i = 0; i < index - 1; i++) {
p = p.next;
}
Node n = p.next;
ret = n.data;
p.next = n.next;
n.next = null;
}
size--;
return ret;
}
@Override
public E get(int index) {
if (index < 0 || index >= size){
throw new IllegalArgumentException("get index out of range");
}
if (index == 0){
return head.data;
}else if (index == size - 1){
return tail.data;
}else {
Node p = head;
for (int i = 0; i < index; i++) {
p = p.next;
}
return p.data;
}
}
@Override
public E set(int index, E element) {
if (index < 0 || index >= size){
throw new IllegalArgumentException("get index out of range");
}
E ret = null;
if (index == 0){
ret = head.data;
head.data = element;
}else if (index == size - 1){
ret = tail.data;
tail.data = element;
}else {
Node p = head;
for (int i = 0; i < index; i++) {
p = p.next;
}
ret = p.data;
p.data = element;
}
return ret;
}
@Override
public int size() {
return size;
}
@Override
public int indexOf(E element) {
Node p = head;
int index = 0;
while (!p.data.equals(element)){
p = p.next;
index++;
if (p == head){
return -1;
}
}
return index;
}
@Override
public boolean contains(E element) {
return indexOf(element) != -1;
}
@Override
public boolean isEmpty() {
return size == 0 && head == null && tail == null;
}
@Override
public void clear() {
head = null;
tail = null;
size = 0;
}
@Override
public void sort(Comparator<E> c) {
if (c == null){
throw new IllegalArgumentException("comparator can not be null");
}
//此处不能用插入排序
// for (int i = 0; i < size; i++) {
// E e = get(i);
// int j = 0;
// for (j = i; j > 0 && c.compare(get(j - 1), e) > 0; j--){
// set(j, get(j - 1));
// }
// set(j, e);
// }
if (size == 0 || size == 1){
return;
}
Node nodeA = head;
Node nodeB = nodeA.next;
while(true){
while (true){
if (c.compare(nodeA.data,nodeB.data) > 0){
swap(nodeA, nodeB);
}
if (nodeB == tail){
break;
}
nodeB = nodeB.next;
}
if (nodeA.next == tail){
break;
}
nodeA = nodeA.next;
nodeB = nodeA.next;
}
}
private void swap(Node nodeA, Node nodeB) {
E temp = nodeA.data;
nodeA.data = nodeB.data;
nodeB.data = temp;
}
@Override
public List<E> subList(int fromIndex, int toIndex) {
// 0 <= fromIndex <= toIndex <= size -1 [fromIndex,toIndex]
if (fromIndex < 0 || toIndex >= size || fromIndex > toIndex){
throw new IllegalArgumentException("0 <= fromIndex <= toIndex <= size -1");
}
LinkedSinglyList<E> list = new LinkedSinglyList<>();
for (int i = fromIndex; i <= toIndex ; i++) {
list.add(get(i));
}
Node nodeA = head;
for (int i = 0; i < fromIndex; i++) {
nodeA = nodeA.next;
}
Node nodeB = head;
for (int i = 0; i < fromIndex; i++) {
nodeB = nodeB.next;
}
Node p = nodeA;
while(true){
list.add(p.data);
if (p == nodeB){
break;
}
p = p.next;
}
return list;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
if (isEmpty()){
sb.append(']');
}else {
Node p = head;
while (true) {
sb.append(p.data);
if (p == tail) {
sb.append(']');
break;
}
sb.append(',');
sb.append(' ');
p = p.next;
}
}
return sb.toString();
}
@Override
public Iterator<E> iterator() {
return new LinedSinglyCircularListIterator();
}
class LinedSinglyCircularListIterator implements Iterator<E>{
private Node cur = head;
private boolean flag = true;//是否跑到了第二圈
@Override
public boolean hasNext() {
if (isEmpty()){
return false;
}
return flag;
}
@Override
public E next() {
E ret = cur.data;
cur = cur.next;
if (cur == head){
flag = false;
}
return ret;
}
}
public void josephusLoop(){
if (size <= 2){
return;
}
Node p = head;
while (size != 2){
p = p.next;
Node del = p.next;
if (del == head){
head = del.next;
}else if (del == tail){
tail = p;
}
p.next = del.next;
del.next = null;
p = p.next;
size--;
}
}
}
逢七过游戏
//逢七过游戏
/*
输入玩家个数
输入从哪个玩家开始
输入改玩家从哪个数字开始
输入一共玩几个数字
打印出每个玩家将要报出的所有数字
*/
public class SevenGame {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println(">>>请输入玩家的个数:");
int playerCount = input.nextInt();
System.out.println(">>>请输入从哪个玩家开始:");
int beginPlayer = input.nextInt();
System.out.println(">>>请输入从哪个数字开始:");
int beginNumber = input.nextInt();
System.out.println(">>>请输入数字的最大值:");
int maxNumber = input.nextInt();
//创建玩家的集合
LinkedSinglyCircularList<ArrayList<String>> list = new LinkedSinglyCircularList<>();
//分别创建玩家的对象
for (int i = 0; i < playerCount; i++) {
list.add(new ArrayList<>());
}
//开始的玩家角标
int index = beginPlayer - 1;
for (int num = beginNumber; num <= maxNumber ; num++) {
String answer = getAnswer(num);
list.get(index++ % playerCount).add(answer);
}
for (int i = 0; i < list.size(); i++) {
System.out.println("第" + (i + 1) + "位玩家:" + list.get(i));
}
}
private static String getAnswer(int num) {
if (num % 7 == 0 || (num + "").contains("7")){
return "过";
}
return num + "";
}
}