Question

Python3

You should use the getters and setters I post in the first pic

157 158 class LinkNode: 159 160 def-initー(self.value,nxt One): assert isinstance(nxt,Lin㎾ode) or nxt is None self.value value self.next = nxt 61 162 163 164 165 166 167 168 169 170 def get_value(self): def set_value(self, value): def get_next(seif): def set_next(self,nxt): def _repr (self): return self.value self.value = value return self.next self.next = nxt return repr(self.value)+ ", "+repr(self.next) 172 173

Answer 1

Complete Code:

class LinkNode: def __init_(self, value, nxt=None): assert isinstance (nxt, LinkNode) or nxt is None self.value = value self.next = nxt def get_value (self): return self.value def set value (self, value) : self.value = value def get_next (seif): return self.next def set next (self, nxt): self.next = nxt def_repr__(self): return repr (self.value) + ", "+repr (self.next) def permutation (link, k): assert isinstance (link, LinkNode) or link is None result = U count = 0 curr = link while curr is not None and curr.next is not link: count = count + 1 curr = curr.next temp = link for i in range (count+1): result.append(temp.value) for j in range (k): temp = temp.next result.append(temp.value) result.append (None) if k == count+1: temp = temp.next return result

Sample Output:

>>> temp = LinkNode (1, LinkNode (2, LinkNode (3, LinkNode (4, LinkNode (5))))) >>> ptr = temp >>> while ptr.next is not None: ptr = ptr.next >>> ptr.next = temp >>> del ptr >>> permutation (temp, 2) [1, 3, None, 3, 5, None, 5, 2, None, 2, 4, None, 4, 1, None] >>> temp = LinkNode (1, LinkNode (2, LinkNode (3) ) ) >>> ptr = temp >>> while ptr.next is not None: ptr = ptr.next >>> ptr.next = temp >>> del ptr >>> permutation (temp, 3) [1, 1, None, 2, 2, None, 3, 3, None] >>>

CODE TO COPY:

class LinkNode:
    def __init__(self,value,nxt=None):
        assert isinstance(nxt,LinkNode) or nxt is None
        self.value = value
        self.next = nxt
    def get_value(self):
        return self.value
    def set_value(self, value):
        self.value = value
    def get_next(seif):
        return self.next
    def set_next(self,nxt):
        self.next = nxt
    def __repr__(self):
        return repr(self.value)+ ", "+repr(self.next)
  

def permutation(link, k):
    assert isinstance(link,LinkNode) or link is None

    result = []
    count = 0
    curr = link  
    while curr is not None and curr.next is not link:
        count = count + 1
        curr = curr.next      
  
    temp = link  
    for i in range(count+1):
        result.append(temp.value)      
        for j in range(k):
            temp = temp.next      
        result.append(temp.value)
        result.append(None)
        if k == count+1:
            temp = temp.next
      
    return result