Python LinkedList.find_k_node_value示例

示例#1

def test_kth_value_one():
    ll = LinkedList()
    ll.insert("1")
    actual = ll.find_k_node_value(0)
    expected = '1'
    assert actual == expected

示例#2

def test_kth_value_mid_length():
    ll = LinkedList()
    ll.insert("1", "2", "3", "4", "5")
    actual = ll.find_k_node_value(2)
    expected = '3'
    assert actual == expected

示例#3

def test_kth_value_negativeKay():
    ll = LinkedList()
    ll.insert("1", "2", "3")
    actual = ll.find_k_node_value(-15)
    expected = "Exception"
    assert actual == expected

示例#4

def test_kth_value_zeroKay():
    ll = LinkedList()
    ll.insert("1", "2", "3")
    actual = ll.find_k_node_value(0)
    expected = '1'
    assert actual == expected

示例#5

def test_kth_value_empty_list():
    ll = LinkedList()
    actual = ll.find_k_node_value(3)
    expected = "Exception"
    assert actual == expected