/**  
 * 找到约瑟夫环结点  
 *  
 * @param n 共n个人  
 * @param m 需要排除第m个结点  
 * @return 最后剩下的结点  
 */  
private static NormalListNode getJosephusPosition(int n, int m) {  
    if (n < 1) {  
        return null;  
    }  
    // 生成循环链表  
    NormalListNode head = new NormalListNode(1);  
    NormalListNode cur = head;  
    for (int i = 1; i < n; i++) {  
        cur.setNext(new NormalListNode(i + 1));  
        cur = cur.getNext();  
    }  
    cur.setNext(head);  
    // 获取约瑟夫环节点  
    return getJosephusPosition(head, m);  
}  

/**  
 * 找到约瑟夫环结点  
 *  
 * @param headNode 头结点  
 * @param m        需要排除第m个结点  
 * @return 最后剩下的结点  
 */  
private static NormalListNode getJosephusPosition(NormalListNode headNode, int m) {  
    if (headNode == null || headNode.getNext() == headNode) {  
        return headNode;  
    }  
    NormalListNode cur = headNode;  
    NormalListNode previous = null;  
    while (cur.getNext() != cur) {  
        int count = m;  
        while (--count > 0) {  
            previous = cur;  
            cur = cur.getNext();  
        }  
        previous.setNext(cur.getNext());  
        cur = cur.getNext();  
    }  
    return cur;  
}