本文共 3406 字，大约阅读时间需要 11 分钟。

????????????????

???????????????????n???????????????????????????????????????????????????

????

???????????????1?n?n???????????????????m??????????????????????????????????????????

????n=5?k=1?m=2???????2?4?1?5?3?

??????

???????????????????????????????????????

????

package com.wang.linkedlist;
class Boy {
    private int no;
    private Boy next;
    public Boy(int no) {
        this.no = no;
        this.next = null;
    }
    public int getNo() {
        return no;
    }
    public void setNext(Boy next) {
        this.next = next;
    }
}
class CircleSingleLinkedList {
    private Boy first;
    public CircleSingleLinkedList() {
        first = null;
    }
    public void addBoy(int nums) {
        if (nums < 1) {
            System.out.println("nums??????");
            return;
        }
        Boy curBoy = null;
        for (int i = 1; i <= nums; i++) {
            Boy boy = new Boy(i);
            if (i == 1) {
                first = boy;
                first.setNext(first);
                curBoy = first;
            } else {
                curBoy.setNext(boy);
                boy.setNext(first);
                curBoy = boy;
            }
        }
    }
    public void showBoy() {
        if (first == null) {
            System.out.println("?????????");
            return;
        }
        Boy curBoy = first;
        while (true) {
            System.out.println("??????" + curBoy.getNo());
            if (curBoy.getNext() == first) {
                break;
            }
            curBoy = curBoy.getNext();
        }
    }
    public void countBoy(int startNo, int countNum, int nums) {
        if (first == null || startNo < 1 || startNo > nums) {
            System.out.println("????????????");
            return;
        }
        Boy helper = first;
        while (true) {
            if (helper.getNext() == first) {
                break;
            }
            helper = helper.getNext();
        }
        for (int j = 0; j < startNo - 1; j++) {
            helper = helper.getNext();
        }
        Boy current = helper;
        while (nums > 0) {
            for (int i = 0; i < countNum - 1; i++) {
                helper = helper.getNext();
                if (helper == null) {
                    helper = first;
                }
            }
            System.out.println("?????" + current.getNo());
            current = current.getNext();
            if (current == null) {
                current = first;
            }
            first = first.getNext();
            helper.setNext(first);
            nums--;
        }
    }
    public static void main(String[] args) {
        CircleSingleLinkedList circleSingleLinkedList = new CircleSingleLinkedList();
        circleSingleLinkedList.addBoy(5);
        circleSingleLinkedList.showBoy();
        circleSingleLinkedList.countBoy(1, 2, 5);
    }
}

????

??

????????????????????????????????????????????????????????????

转载地址：http://ooik.baihongyu.com/