约瑟夫环 链表java_java链表实现约瑟夫环

实现如下

package com.wzl;

/**

* @author wuzhilang

* @Title: Link

* @ProjectName ranking

* @Description: java链表实现约瑟夫环

* @date 2019/4/289:42

*/

class ListNode{

int data;

ListNode next;

}

public class Link{

public static ListNode JosephCycle(ListNode first,int k){

//第一步：链表构成环

ListNode tail = first;

while (tail.next != null){

tail = tail.next;

}

tail.next = first;

//第二步删除

ListNode cur = first;

while(cur.next != cur){//当链表中的节点只剩下最后一个时，跳出循环

ListNode prev = null;

for(int i = 0;i

prev = cur;

cur = cur.next;

} // cur就是要删除的点

prev.next = cur.next;

cur = null;

cur = prev.next;