Example #1
0
# -*- coding: utf-8 -*-
# @Time    : 2018/7/27 22:34
# @Author  : leo cheng
# @Email   : [email protected]
# @File    : exercise_1.3.27.py
# @Software: PyCharm
from Chapter1_Fundamentals.bagqueuestack.link_list import LinkList, Node


def max(first_node):
    result = 0
    while first_node.next_node is not None:
        if first_node.item_value > result:
            result = first_node.item_value
        first_node = first_node.next_node
    return result


if __name__ == '__main__':
    link_list = LinkList()
    link_list.append(Node(1))
    link_list.append(Node(2))
    link_list.append(Node(7))
    link_list.append(Node(3))
    link_list.append(Node(5))
    link_list.append(Node(11))
    link_list.append(Node(1))
    link_list.append(Node(3))
    link_list.append(Node(6))
    print(max(link_list[0]))
 def __init__(self):
     self.__data_list = LinkList()
Example #3
0
 def __init__(self):
     self.__link_list = LinkList()
Example #4
0
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time    : 2018/7/26 23:08
# @Author  : leo cheng
# @Email   : [email protected]
# @File    : exercise_1.3.26.py
# @Software: PyCharm
from Chapter1_Fundamentals.bagqueuestack.link_list import LinkList, Node


def remove(link_list, key):
    temp_node = link_list[0]
    for node in link_list:
        if node.item_value == key:
            temp_node.next_node = node.next_node
        else:
            temp_node = node


if __name__ == '__main__':
    search_list = LinkList()
    search_list.append(Node(1))
    search_list.append(Node(2))
    search_list.append(Node(2))
    search_list.append(Node(3))
    search_list.append(Node(2))
    search_list.append(Node(4))
    remove(search_list, 2)