python链表实现左移和右移

def __lshift__(self, n):

    return self.rotate(n)

def __rshift__(self, n):

    return self.rotate(-n)

    def __lshift__(self, n):

        ret = self.rotate(n)

        self.val,self.next = ret.val,ret.next

        return ret

    def __rshift__(self, n):

        ret = self.rotate(-n)

        self.val,self.next = ret.val,ret.next

        return ret

'''

>>> node = Node.build(1,2,3,4,5)

>>> node

Node(1->2->3->4->5->None)

>>> node >> 1

Node(5->1->2->3->4->None)

>>> node >> 2

Node(3->4->5->1->2->None)

>>> node >> 3

Node(5->1->2->3->4->None)

>>> node

Node(5->1->2->3->4->None)

>>> node << 6

Node(1->2->3->4->5->None)

>>> node << 1

Node(2->3->4->5->1->None)

>>> node << 1

Node(3->4->5->1->2->None)

>>> node >> 2

Node(1->2->3->4->5->None)

>>> node

Node(1->2->3->4->5->None)

>>>

'''