约瑟夫问题 算法 数据结构 循环单链表

// MARK: - 约瑟夫问题

// 链表节点
class Node: NSObject {
    var next: Node?
    var value: Int?
}

// 人的编号
var i = 1
// 头节点
let headNode = Node()
headNode.value = 1
// 总人数
let m = 12

// 创建循环单链表
func generateListNode(node: Node) {
    i += 1
    if i > m {
        node.next = headNode
        return
    }
    let nextNode = Node()
    node.next = nextNode
    nextNode.value = i
    generateListNode(node: nextNode)
}

var num1 = 0, num2 = 0
// 数到3的人死
func threeKillOne(node: Node) -> (Int, Int) {
    if node.next?.next == node {
        num1 = node.next!.value!
        num2 = node.value!
        return (num1, num2)
    }
    let killedNode = node.next?.next
    let preKilledNode = node.next
    preKilledNode?.next = killedNode?.next
    killedNode?.next = nil
    threeKillOne(node: preKilledNode!.next!)
    return (num1, num2)
}

// 创建循环单链表
generateListNode(node: headNode)
// 得到最后活下来的2人编号
let (result1, result2) = threeKillOne(node: headNode)
print(result1, result2)