from time import clock import sys class LinkedListNode: def __init__(self, inData, inNext): """Construct a new Linked List Node""" self.data = inData self.next = inNext def GetNextNode(self): return self.next def GetData(self): return self.data class LinkedList: def __init__(self,max): self.firstNode = LinkedListNode(None, None) self.lastNode = self.firstNode self.size = 0 self.maxsize=max def Add(self, data): node = LinkedListNode(data, None) if self.size<=self.maxsize: if self.firstNode.data == None: self.firstNode = node self.lastNode = node else: self.lastNode.next = node self.lastNode = node self.size += 1 else: out.write(str("List is Overflowed")) def Remove(self,index): if index==1: self.firstNode=self.firstNode.next elif index==2: self.firstNode=self.firstNode.next.next else: count=0 currentNode=self.firstNode while count<=index-2: count+=1 currentNode=currentNode.next currentNode.next=currentNode.next.next def GetLength(self): return self.size def Traverse(self): list=[] tnode=self.firstNode while tnode!=None: list.append(tnode.GetData()) tnode=tnode.GetNextNode() out.write(str(list)) f=open('in9_2.txt','r') out=open('out_22_9_2.txt','w') n,m=f.readline().split(',') arr=f.readline().split(',') del_p=f.readline().split(',') start=clock() linkedlist=LinkedList(int(n)) for i in arr: linkedlist.Add(int(i)) for i in del_p: linkedlist.Remove(int(i)) linkedlist.Traverse() elapsed=clock()-start total=sys.getsizeof(n)+sys.getsizeof(m)+sys.getsizeof(arr)+sys.getsizeof(del_p)+sys.getsizeof(linkedlist) out.write('\nmemory: '+str(total)+'\ntime elapsed: '+str(elapsed)+'\n') f.close() out.close()