Sort by

recency

|

2918 Discussions

|

  • + 1 comment
    optimized version:
    
    if __name__ == '__main__':
        N = int(input())
        response_list = []
        command = {
            "insert": lambda x, y : response_list.insert(int(x),int(y)),
            "append": lambda x : response_list.append(int(x)),
            "remove":lambda x : response_list.remove(int(x)),
            "sort":lambda: response_list.sort(),
            "pop":lambda: response_list.pop(),
            "reverse":lambda: response_list.reverse(),
            "print":lambda:print(response_list)
        }
        for i in range(N):
            op,*num = input().split()
            command[op](*num)
    
  • + 0 comments

    if name == 'main': N = int(input()) list=[] for i in range(N):

        arr=input()
        l=arr.split()
        if l[0]=='insert':
            list.insert((int(l[1])),(int(l[2])))
        elif l[0]=='print':
            print(list)
        elif l[0]=='remove':
            list.remove(int(l[1]))
        elif l[0]=='append':
            list.append(int(l[1]))
        elif l[0]=='sort':
            list.sort()
        elif l[0]=='pop':
            list.pop()
        elif l[0]=='reverse':
            list.reverse()
    
  • + 0 comments
    """
    insert i e: Insert integer  at position .
    print: Print the list.
    remove e: Delete the first occurrence of integer .
    append e: Insert integer  at the end of the list.
    sort: Sort the list.
    pop: Pop the last element from the list.
    reverse: Reverse the list.
    """
    
    def inserting(n, b):
        n.insert(b[0], b[1])
    
    def p(n):
        print([i for i in n])
    
    def remove(n, b):
        n.remove(b[0])
    
    def add_End(n, b):
        n.extend(b)
    
    def sorting(n):
        n.sort()
    
    def popping(n):
        n.pop()
    
    def reversing(n):
        n.reverse()
    
    def main():
        NumberList = []
        x = int(input())
        for i in range(x):
            a, *b = input().split()
            b = [int(i) for i in b]
            match a:
                case 'insert':
                    inserting(NumberList, b)
                case 'print':
                    p(NumberList)
                case 'remove':
                    remove(NumberList, b)
                case 'append':
                    add_End(NumberList, b)
                case 'sort':
                    sorting(NumberList)
                case 'pop':
                    popping(NumberList)
                case 'reverse':
                    reversing(NumberList)
    
    main()
    
  • + 0 comments
    if __name__ == '__main__':
        N = int(input())
        l = []
        for _ in range(0, N):
            x = str(input()).split()
            func = x[0]
            input_val = x[1:]
            if func == 'insert':
                expr = f"l.{func}({input_val[0]}, {input_val[1]})"
            elif func == 'print': 
                expr = f"{func}(l)"
            elif input_val:
                expr = f"l.{func}({input_val[0]})"
            else:
                expr = f"l.{func}()"
            eval(expr)
            
    
            
            
    
  • + 0 comments
    N = int(input())
    l = []      
    
    def performOperation(cmdList):
        match cmdList[0]:
            case 'insert': l.insert(int(cmdList[1]),int(cmdList[2]))                            
            case 'append': l.append(int(cmdList[1]))
            case 'remove': l.remove(int(cmdList[1]))
            case 'sort': l.sort()
            case 'pop': l.pop()
            case 'reverse': l.reverse()
            case 'print': print(l)
            case _: return
    
    for i in range(N):
        cmd = input()        
        performOperation(cmd.split(" "))