-
Notifications
You must be signed in to change notification settings - Fork 0
/
61.rotated list.py
110 lines (94 loc) · 2.33 KB
/
61.rotated list.py
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
class Node:
def __init__(self,initdata):
self.data = initdata
self.next = None
def getData(self):
return self.data
def getNext(self):
return self.next
def setData(self,newdata):
self.data = newdata
def setNext(self,newnext):
self.next = newnext
class OrderedList:
def __init__(self):
self.head = None
def search(self,item):
current = self.head
found = False
stop = False
while current != None and not found and not stop:
if current.getData() == item:
found = True
else:
if current.getData() > item:
stop = True
else:
current = current.getNext()
return found
def add(self,item):
current = self.head
previous = None
stop = False
while current != None and not stop:
if current.getData() > item:
stop = True
else:
previous = current
current = current.getNext()
temp = Node(item)
if previous == None:
temp.setNext(self.head)
self.head = temp
else:
temp.setNext(current)
previous.setNext(temp)
def isEmpty(self):
return self.head == None
def size(self):
current = self.head
count = 0
while current != None:
count = count + 1
current = current.getNext()
return count
def print_list(node):
li = []
while node:
li.append(node.data)
node = node.next
print li
class Solution(object):
def rotateRight(self, head, k):
"""
:type head: ListNode
:type k: int
:rtype: ListNode
"""
p1 = head
p = head
length =1
if k==0 or (not head) or (not head.next):
return head
while p.next:
p = p.next
length+=1
k = k%length
if k==0:
return head
for i in range(length -k-1):
p1 = p1.next
a = p1.next
p.next = head
p1.next = None
return a
l= OrderedList()
l.add(1)
l.add(2)
l.add(3)
l.add(4)
l.add(5)
n = l.head
print n.getData()
print_list(n)
print_list(Solution().rotateRight(n,5))