ChatGPT解决这个技术问题 Extra ChatGPT

Difference between del, remove, and pop on lists

Is there any difference between these three methods to remove an element from a list?

>>> a = [1, 2, 3]
>>> a.remove(2)
>>> a
[1, 3]

>>> a = [1, 2, 3]
>>> del a[1]
>>> a
[1, 3]

>>> a = [1, 2, 3]
>>> a.pop(1)
2
>>> a
[1, 3]
Related post on similar lines for set data structure - Runtime difference between set.discard and set.remove methods in Python?

m
mit

The effects of the three different methods to remove an element from a list:

remove removes the first matching value, not a specific index:

>>> a = [0, 2, 3, 2]
>>> a.remove(2)
>>> a
[0, 3, 2]

del removes the item at a specific index:

>>> a = [9, 8, 7, 6]
>>> del a[1]
>>> a
[9, 7, 6]

and pop removes the item at a specific index and returns it.

>>> a = [4, 3, 5]
>>> a.pop(1)
3
>>> a
[4, 5]

Their error modes are different too:

>>> a = [4, 5, 6]
>>> a.remove(7)
Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
ValueError: list.remove(x): x not in list
>>> del a[7]
Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
IndexError: list assignment index out of range
>>> a.pop(7)
Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
IndexError: pop index out of range

I thought del was a python 2 syntax holdover like print, but it still works in python 3.
@jxramos: del is not a syntax holdover, no. The syntax is unchanged, just like return or if or while.
It is worth mentioning that users should be careful when iterating over a list and using these functions on it at the same time as they are iterating.
@rite2hhh it tests for equality. Equality tests test for identity first as an optimisation
@rite2hhh: value equality is covered in the expression reference.
j
jtlz2

Use del to remove an element by index, pop() to remove it by index if you need the returned value, and remove() to delete an element by value. The last requires searching the list, and raises ValueError if no such value occurs in the list.

When deleting index i from a list of n elements, the computational complexities of these methods are

del     O(n - i)
pop     O(n - i)
remove  O(n)

Does pop require searching the list
+1 for complexity breakdown. Illustrates how delete and pop are constant when the element is at the end of the list.
Remember guys... anything index based is one shot O(n-1)... if you have to do a lookup (by value), it will traverse the collection until the element is found.
@PepitoFernandez Look-ups by index in a list are O(1) in Python. (A list in Python is similar to a vector in C++.)
@PlasmaBinturong You should use what you think is more readable, unless you have data that proves that the performance matters. And if you have, you need to measure what's faster in your specific case. My guess is also that del is slightly faster, but for a different reason: the lookup for __delitem__ on a type implemented in C happens by index rather than by name, whereas pop needs to be looked up following the whole descriptor protocol. The execution of the functions themselves should take the same amount of time. Both return a pointer – one to the removed object, the other to None.
C
Chris_Rands

Since no-one else has mentioned it, note that del (unlike pop) allows the removal of a range of indexes because of list slicing:

>>> lst = [3, 2, 2, 1]
>>> del lst[1:]
>>> lst
[3]

This also allows avoidance of an IndexError if the index is not in the list:

>>> lst = [3, 2, 2, 1]
>>> del lst[10:]
>>> lst
[3, 2, 2, 1]

C
Community

Already answered quite well by others. This one from my end :)

https://i.stack.imgur.com/9Yzgv.png

Evidently, pop is the only one which returns the value, and remove is the only one which searches the object, while del limits itself to a simple deletion.


Thnx! One note: in python, due to the way the lists are implemented(there practically arrays...!), "Advance till that node position" is O(1)
N
NerdOnTour

Many good explanations are here but I will try my best to simplify more.

Among all these methods, remove & pop are postfix while delete is prefix.

remove(): Is used to remove first occurrence of element.
remove(n) => first occurrence of n in the list.

>>> a = [0, 2, 3, 2, 1, 4, 6, 5, 7]
>>> a.remove(2)   # where i = 2
>>> a
[0, 3, 2, 1, 4, 6, 5, 7]

pop(): Is used to remove element ...

if no index is specified: pop() => from end of list

>>> a.pop()
>>> a
[0, 3, 2, 1, 4, 6, 5]

if an index is specified: pop(index) => of index

>>> a.pop(2)
>>> a
[0, 3, 1, 4, 6, 5]

WARNING: Dangerous Method Ahead

del(): It's a prefix method.

Keep an eye on two different syntaxes for same method: with [] and without. It possesses power to:

Delete index del a[index] => used to delete by index and its associated value just like pop.

>>> del a[1]
>>> a
[0, 1, 4, 6, 5]

Delete values in range [index_1:index_N]: del a[0:3] => multiple values in range.

>>> del a[0:3]
>>> a
[6, 5]

Last but not least, to delete whole list in one shot. del (a) => as said above.

>>> del (a)
>>> a
Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
NameError: name 'a' is not defined

Hope this clarifies the confusion.


what is difference between postfix and prefix?
Postfix remove function: finds value and removes it. Prefix remove function: removes based on prefix
a
ack

pop

Takes index (when given, else take last), removes value at that index, and returns value

remove

Takes value, removes first occurrence, and returns nothing

delete

Takes index, removes value at that index, and returns nothing


pop also remove the value from the list
p
phanindravarma

Any operation/function on different data structures is defined for particular actions. Here in your case i.e. removing an element, delete, Pop and remove. (If you consider sets, Add another operation - discard) Other confusing case is while adding. Insert/Append. For Demonstration, Let us Implement deque. deque is a hybrid linear data structure, where you can add elements / remove elements from both ends.(Rear and front Ends)

class Deque(object):

  def __init__(self):

    self.items=[]

  def addFront(self,item):

    return self.items.insert(0,item)
  def addRear(self,item):

    return self.items.append(item)
  def deleteFront(self):

    return self.items.pop(0)
  def deleteRear(self):
    return self.items.pop()
  def returnAll(self):

    return self.items[:]

In here, see the operations:

def deleteFront(self):

    return self.items.pop(0)
def deleteRear(self):
    return self.items.pop()

Operations have to return something. So, pop - With and without an index. If I don't want to return the value: del self.items[0]

Delete by value not Index:

remove : list_ez=[1,2,3,4,5,6,7,8] for i in list_ez: if i%2==0: list_ez.remove(i) print list_ez

Returns [1,3,5,7]

let us consider the case of sets.

set_ez=set_ez=set(range(10))

set_ez.remove(11)

# Gives Key Value Error. 
##KeyError: 11

set_ez.discard(11)

# Does Not return any errors.

N
Nitish

Here is a detailed answer.

del can be used for any class object whereas pop and remove and bounded to specific classes.

For del

Here are some examples

>>> a = 5
>>> b = "this is string"
>>> c = 1.432
>>> d = myClass()

>>> del c
>>> del a, b, d   # we can use comma separated objects

We can override __del__ method in user-created classes.

Specific uses with list

>>> a = [1, 4, 2, 4, 12, 3, 0]
>>> del a[4]
>>> a
[1, 4, 2, 4, 3, 0]

>>> del a[1: 3]   # we can also use slicing for deleting range of indices
>>> a
[1, 4, 3, 0]

For pop

pop takes the index as a parameter and removes the element at that index

Unlike del, pop when called on list object returns the value at that index

>>> a = [1, 5, 3, 4, 7, 8]
>>> a.pop(3)  # Will return the value at index 3
4
>>> a
[1, 5, 3, 7, 8]

For remove

remove takes the parameter value and remove that value from the list.

If multiple values are present will remove the first occurrence

Note: Will throw ValueError if that value is not present

>>> a = [1, 5, 3, 4, 2, 7, 5]
>>> a.remove(5)  # removes first occurence of 5
>>> a
[1, 3, 4, 2, 7, 5]
>>> a.remove(5)
>>> a
[1, 3, 4, 2, 7]

Hope this answer is helpful.


K
Kushan Gunasekera

The remove operation on a list is given a value to remove. It searches the list to find an item with that value and deletes the first matching item it finds. It is an error if there is no matching item, raises a ValueError.

>>> x = [1, 0, 0, 0, 3, 4, 5]
>>> x.remove(4)
>>> x
[1, 0, 0, 0, 3, 5]
>>> del x[7]
Traceback (most recent call last):
  File "<pyshell#1>", line 1, in <module>
    del x[7]
IndexError: list assignment index out of range

The del statement can be used to delete an entire list. If you have a specific list item as your argument to del (e.g. listname[7] to specifically reference the 8th item in the list), it'll just delete that item. It is even possible to delete a "slice" from a list. It is an error if there index out of range, raises a IndexError.

>>> x = [1, 2, 3, 4]
>>> del x[3]
>>> x
[1, 2, 3]
>>> del x[4]
Traceback (most recent call last):
  File "<pyshell#1>", line 1, in <module>
    del x[4]
IndexError: list assignment index out of range

The usual use of pop is to delete the last item from a list as you use the list as a stack. Unlike del, pop returns the value that it popped off the list. You can optionally give an index value to pop and pop from other than the end of the list (e.g listname.pop(0) will delete the first item from the list and return that first item as its result). You can use this to make the list behave like a queue, but there are library routines available that can provide queue operations with better performance than pop(0) does. It is an error if there index out of range, raises a IndexError.

>>> x = [1, 2, 3] 
>>> x.pop(2) 
3 
>>> x 
[1, 2]
>>> x.pop(4)
Traceback (most recent call last):
  File "<pyshell#1>", line 1, in <module>
    x.pop(4)
IndexError: pop index out of range

See collections.deque for more details.


s
skashyap

While pop and delete both take indices to remove an element as stated in above comments. A key difference is the time complexity for them. The time complexity for pop() with no index is O(1) but is not the same case for deletion of last element.

If your use case is always to delete the last element, it's always preferable to use pop() over delete(). For more explanation on time complexities, you can refer to https://www.ics.uci.edu/~pattis/ICS-33/lectures/complexitypython.txt


This is wrong in multiple ways. There is no such method as delete. The differences are that pop returns the value, and that del works on slices. In cases where pop works, del has exactly the same computational complexity (and is slightly faster by a constant term).
H
Harshal SG

Remove basically works on the value . Delete and pop work on the index

Remove basically removes the first matching value. Delete deletes the item from a specific index Pop basically takes an index and returns the value at that index. Next time you print the list the value doesnt appear.

https://i.stack.imgur.com/ExsEy.png


Though we thank you for your answer, it would be better if it provided additional value on top of the other answers. In this case, your answer does not provide additional value, since other users covered everything that you have included in your answer. As a secondary issue, please don't include text as pictures when you could paste it as text. If a previous answer was helpful to you, you should vote it up.
M
Mathias Müller

You can also use remove to remove a value by index as well.

n = [1, 3, 5]

n.remove(n[1])

n would then refer to [1, 5]


Try n = [5, 3, 5], then n.remove(n[2]).
@abarnert your use case works in sync with the below case n = [5,3,5] , then n.remove(5). Both of these remove the first encountered element from the list.
@AkhilGhatiki n.remove(n[2]) removes n[0], not n[2]. So it’s not just linear time for no reason (maybe not a big deal when N=3), it’s also wrong (a big deal no matter what N is)