Note/listnode.py at master · yxmfs/Note · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
class Node(object):
    def __init__(self,val,p=0):
        self.data = val
        self.next = p
class LinkList(object):
    def __init__(self):
        self.head = 0
    def __len__(self):
        p =  self.head
        length = 0
        while p!=0:
            length+=1
            p = p.next
        return length

    def is_empty(self):
        if self.__len__() ==0:
            return True
        else:
            return False
    def clear(self):
        self.head=0
    def append(self,item):
        q = Node(item)
        if self.head ==0:
            self.head = q
        else:
            p = self.head
            while p.next!=0:
                p = p.next
            p.next = q
    def insert(self,index,item):

        if self.is_empty() or index<0 or index >self.__len__():
            print('Linklist is empty.')
            return

        if index ==0:
            q = Node(item,self.head)
            self.head = q

        p = self.head
        post = self.head
        j = 0
        while p.next!=0 and j<index:
            post = p
            p = p.next
            j+=1

        if index ==j:
            q = Node(item,p)
            post.next = q
            q.next = p
        elif index == j+1:
            print('call the append function')
            self.append(item)
        else:
            print('index:{0},j:{1}'.format(index,j))


    def delete(self,index):

        if self.is_empty() or index<0 or index >self.__len__():
            print('Linklist is empty.')
            return

        if index ==0:
            item = self[0]
            q = Node(item,self.head)
            self.head = q

        p = self.head
        post  = self.head
        j = 0
        while p.next!=0 and j<index:
            post = p
            p = p.next
            j+=1

        if index ==j:
            post.next = p.next

    def index(self,value):

        if self.is_empty():
            print('Linklist is empty.')
            return

        p = self.head
        i = 0
        while p.next!=0 and not p.data ==value:
            p = p.next
            i+=1

        if p.data == value:
            return i
        else:
            return -1
    def getitem(self,index):

        if self.is_empty():
            print('Linklist is empty.')
            return
        j = 0
        p = self.head

        while p.next!=0 and j <index:
            p = p.next
            j+=1

        if j ==index:
            return p.data

        else:

            print('target is not exist!')
    def __getitem__(self,key):
        if self.is_empty():
            print('it is empty')
            return
        elif (key < 0)  or (key > self.__len__()):
            print('the given key is error')
            return

        else:
            return self.getitem(key)

    def __setitem__(self, key, value):

        if self.is_empty():
            print('linklist is empty.')
            return

        elif key <0  or key > self.__len__():
            print('the given key is error')
            return

        else:
            self.delete(key)
            return self.insert(key)