programming python Python list rindex

Hướng dẫn python remove last occurrence from list - python xóa lần xuất hiện cuối cùng khỏi danh sách

Thực sự không có gì sai với mã của bạn cả. Nó hoạt động, rõ ràng lý do tại sao nó hoạt động, thật khó để hiểu sai hoặc hiểu lầm.

Vâng, bạn có thể làm cho nó nhanh hơn, nhưng chỉ bởi một yếu tố không đổi. . Cũng sẽ là 

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
0.] Và với chi phí làm cho nó phức tạp hơn.

Cách rõ ràng có lẽ nhanh hơn để làm điều đó là chỉ lặp bằng tay từ cuối cho đến khi chúng ta tìm thấy một giá trị, sau đó xóa giá trị đó. Điều đó cũng tránh phải đối phó với 

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
2. Sử dụng 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
3 có thể giúp đỡ nhưng làm cho nó đúng [mà không sao chép toàn bộ] có thể rất khó khăn.

Vì vậy, hãy so sánh những thứ này với mã hiện tại của bạn, cả hai đã gói nó trong ____ 14/________ 15 và trong một 

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6:

def f_rev_ex[xs, s]:
    xs.reverse[]
    try:
        xs.remove[s]
    except ValueError:
        pass
    xs.reverse[]

def f_rev_if[xs, s]:
    if s in xs:
        xs.reverse[]
        xs.remove[s]
        xs.reverse[]

def f_for[xs, s]:
    for i in range[len[xs]-1, -1, -1]:
        if s == xs[i]:
            del xs[i]
            break

def f_enum[xs, s]:
    for i, x in reversed[list[enumerate[xs]]]:
        if x == s:
            del xs[i]
            break

Đối với một danh sách nhỏ như của bạn, bài kiểm tra thậm chí không đáng để chạy, vì vậy tôi đã phát minh ra dữ liệu ngẫu nhiên của riêng mình [trong cuộc sống thực, tất nhiên là bạn phải biết dữ liệu của mình]:

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop

Chà, cái cuối cùng đó không phải là một ý tưởng rất hay, nhưng cái còn lại nhanh hơn khoảng 25% so với những gì chúng tôi bắt đầu. Vì vậy, chúng tôi đã lưu toàn bộ 9 micro giây, trên dữ liệu 4 đơn đặt hàng lớn hơn dữ liệu thực tế của bạn. Tùy thuộc vào bạn liệu điều đó có xứng đáng với mã không thể đọc được, dễ bị ảnh hưởng hơn hay không. .

Sử dụng các gợi ý, vòng lặp qua toàn bộ danh sách và theo dõi nút trước khi nút chứa khóa xuất hiện cuối cùng bằng cách sử dụng một con trỏ đặc biệt. Sau đó, chỉ cần lưu trữ phần tiếp theo của con trỏ đặc biệt, đến con trỏ đặc biệt tiếp theo để xóa nút cần thiết khỏi danh sách được liên kết.

Python3

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
9

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0____21 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
2
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
4

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
7
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
9

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
7

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
3
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
4
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
7

Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
8
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
3
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 reverse1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 reverse9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5 N2 N3__

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 remove5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 remove7
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 remove9

Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
8
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 reverse9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5 N2 N3__

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
13
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
17

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
35

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
37
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
39
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
40
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
43
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
45

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
47
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
53

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
55

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
3
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
70
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
82
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
83
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
84

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
4
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
7

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
70
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 reverse9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5 N2 N3__

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 remove5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 remove7
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 remove9

Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
8
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
26
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
38
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 reverse9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5 N2 N3__

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
26
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
13
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
17

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
26
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
72
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
84

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
78

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
86
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
84

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
78

Output:

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 N3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 O[n] where n is the number of nodes in the given linked list.
Auxiliary Space: O[1], no extra space is required, so it is a constant.

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Examples:  :  

Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
35

Python3

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
9

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0____21 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
2
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
4

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
7
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
04

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
12

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
14
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
29
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
32

Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
8
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
14
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
36

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
44
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
49
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
53

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
71

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
39
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
40
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
79
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
81

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
36

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
91

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
94
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
00

Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
01
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
86
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
04
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
37
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
47
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
12
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
15
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
16

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
99
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
022141

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
04
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
08
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
04
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2___

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
04
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2___

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
38
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Các

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
08
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Các

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
79
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
84
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
87

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
81
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
08
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
95
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
87

Output:  

Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10

Độ phức tạp về thời gian: O [n] trong đó n là số lượng nút trong danh sách được liên kết đã cho.AUXILIARY Không gian: O [1], không cần thêm không gian, vì vậy nó là một hằng số.O[n] where n is the number of nodes in the given linked list.
Auxiliary Space: O[1], no extra space is required, so it is a constant.

Giải pháp trên không hoạt động khi nút bị xóa là nút cuối cùng. Giải pháp theo dõi xử lý tất cả các trường hợp. & NBSP;
Following solution handles all cases. 

Python3

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
9

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0____21 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
2
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
05

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
7
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
9

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
7

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
29
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
32

Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
8
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
14
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
36

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
44
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
49
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
53

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
71

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
39
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
40
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
79
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
81

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
71

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
39
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
40
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
79
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
81

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
36

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
1 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
91

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
94
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69reverse51
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
32

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
7 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
8
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
82reverse64
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
84

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68 
Created Linked List: 
1  2  3  5  2  10 
Linked List after Deletion of 1: 
1  2  3  5  10
00

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 reverse5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69reverse51
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
0
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
6 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
44
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
5
Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4
1

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
49
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
53

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
5
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
9
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
51
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
04
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
26
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
04
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
2
Input:   1->2->3->5->2->10, key = 2
Output:  1->2->3->5->10
3 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
38
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Các

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
26
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Các

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
01
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
26
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
72
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
78

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
99
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
8 
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
81
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
26
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
68
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
69
Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
86
In [58]: xs = [random.choice[string.ascii_lowercase] for _ in range[10000]]
In [59]: %timeit y = x[:]; f_rev_ex[y, 'a']
10000 loops, best of 3: 34.7 µs per loop
In [60]: %timeit y = x[:]; f_rev_if[y, 'a']
10000 loops, best of 3: 35.1 µs per loop
In [61]: %timeit y = x[:]; f_for[y, 'a']
10000 loops, best of 3: 26.6 µs per loop
In [62]: %timeit y = x[:]; f_enum[y, 'a']
1000 loops, best of 3: 604 µs per loop
41

Created Linked list: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> 4 --> NULL
List after deletion of 4: 1 --> 2 --> 3 --> 4 --> 5 --> 4 --> NULL
78

Output:  

Created Linked List: 
 1  2  3  4  5  4  4 
Linked List after Deletion of 1: 
 1  2  3  4  5  4

Độ phức tạp về thời gian: O [n] trong đó n là số lượng nút trong danh sách được liên kết đã cho.AUXILIARY Không gian: O [1], không cần thêm không gian, vì vậy nó là một hằng số.O[n] where n is the number of nodes in the given linked list.
Auxiliary Space: O[1], no extra space is required, so it is a constant.

Vui lòng tham khảo hoàn thành bài viết về xóa lần xuất hiện cuối cùng của một mục từ danh sách được liên kết để biết thêm chi tiết!


Làm cách nào để loại bỏ sự xuất hiện cuối cùng của một danh sách trong Python?

Khoa học dữ liệu thực tế sử dụng Python..
Khởi tạo danh sách ..
Đảo ngược danh sách bằng phương pháp đảo ngược ..
Tìm chỉ mục của phần tử bằng phương thức chỉ mục ..
Chỉ số thực tế của phần tử là LEN [Danh sách] - INDEX - 1 ..
In chỉ số cuối cùng ..

Làm cách nào để loại bỏ 10 mục cuối cùng khỏi danh sách trong Python?

Sử dụng câu lệnh DEL với việc cắt danh sách để loại bỏ các yếu tố N cuối cùng khỏi danh sách, ví dụ:del my_list [len [my_list] - n:] Câu lệnh DEL sẽ xóa các phần tử n cuối cùng khỏi danh sách ban đầu., e.g. del my_list[len[my_list] - n:] The del statement will remove the last N elements from the original list.

Làm cách nào để loại bỏ một lần xuất hiện khỏi danh sách trong Python?

Phương thức pop [] loại bỏ một phần tử tại một chỉ mục nhất định và cũng sẽ trả về mục đã xóa.Bạn cũng có thể sử dụng từ khóa DEL trong Python để xóa một phần tử hoặc lát khỏi danh sách.pop[] method removes an element at a given index, and will also return the removed item. You can also use the del keyword in Python to remove an element or slice from a list.

Làm thế nào để bạn tìm thấy sự xuất hiện cuối cùng của một nhân vật trong một danh sách trong Python?

Phương thức rfind [] tìm thấy sự xuất hiện cuối cùng của giá trị được chỉ định.Phương thức rfind [] trả về -1 nếu không tìm thấy giá trị.rfind[] method finds the last occurrence of the specified value. The rfind[] method returns -1 if the value is not found.

Bài Viết Liên Quan

Hướng dẫn change profile picture html - thay đổi ảnh hồ sơ html
Hướng dẫn is python easier than c++ reddit - python có dễ hơn c ++ reddit không
Hướng dẫn curl not working in php - curl không hoạt động trong php
2023 tuổi thìn
Nhà cái mới nhất 2023
Hướng dẫn secure file python - python tệp an toàn
Hướng dẫn convert xml to csv python - chuyển đổi xml sang csv python
Hướng dẫn convert text file to binary python - chuyển đổi tệp văn bản sang python nhị phân
Hướng dẫn how do you anchor text in html? - làm thế nào để bạn neo văn bản trong html?
Lý thuyết password attacks trên kali linux
Điểm sàn viện đại học mở 2023
Hướng dẫn smallest remainder in python assignment expert - phần còn lại nhỏ nhất trong chuyên gia phân công python
Hướng dẫn get last day of month excel - lấy excel ngày cuối cùng của tháng
Hướng dẫn how do i make multiple excel sheets in pandas? - làm cách nào để tạo nhiều trang tính excel bằng gấu trúc?
Hướng dẫn phpunit composer - nhà soạn nhạc phpunit
Bốc thăm chia bảng vòng loại Asian Cup 2023
Hướng dẫn module mbstring ini file doesnt exist under /etc/php 8.0 mods-available - mô-đun mbstring tệp ini không tồn tại trong / etc / php 8.0 mods-sẵn có
Hướng dẫn turing php test answers - turing câu trả lời kiểm tra php
Hướng dẫn html link with access - liên kết html có quyền truy cập
Hướng dẫn what is html used for mcq? - html được sử dụng cho mcq là gì?

Toplist mới

#1
Top 7 tết mậu thân năm 1968 đã diễn ra sự kiện gì ở miền nam nước ta 2023
6 tháng trước
#2
Top 13 luyện từ và câu: dấu gạch ngang lớp 4 trang 45 2023
6 tháng trước
#3
Top 6 trong mặt phẳng oxy ảnh của đường thẳng d 3x y 4=0 2023
6 tháng trước
#4
Top 6 thử thách thần chết thuyết minh phần 2 2023
6 tháng trước
#5
Top 4 vở bài tập tiếng việt lớp 3 tập 2 chính tả trang 15 2023
6 tháng trước
#6
Top 5 áo khoác nam quảng châu cao cấp 2023
6 tháng trước
#7
Top 4 nội dung nào sau đây không phải là trách nhiệm của đơn vị đầu mối cung cấp thông tin 2023
6 tháng trước
#8
Top 9 mẫu đồng phục công sở đẹp 2022 2023
6 tháng trước
#9
Top 5 ốp lưng iphone 13 pro bảo vệ camera 2023
6 tháng trước

Bài mới nhất

Cải làm dưa chua là cải gì năm 2024
Các sản phẩm làm đẹp tiếng anh là gì năm 2024
Bán hàng phát sinh giảm giá hoạch toán tn năm 2024
Lá thư trong tiếng anh là gì năm 2024
Mẫu hợp đồng thanh toán qua bên thứ 3 năm 2024
Giải sách bài tập tiếng anh lớp 7 trang 8 năm 2024
1994 sinh con năm 2023 tháng nào tốt năm 2024
Dịch vụ chuyển văn phòng tại thanh hóa năm 2024
Font việt hóa không hiển thị giống như demo năm 2024
Các trường của 1 đối tượng là gì năm 2024

Chủ Đề

programming Hỏi Đáp Là gì Mẹo Hay Toplist Địa Điểm Hay Học Tốt mẹo hay Công Nghệ Nghĩa của từ Bao nhiêu Khỏe Đẹp đánh giá Tiếng anh Top List bao nhieu bao nhiêu hướng dẫn Món Ngon So Sánh Bài tập So sánh Xây Đựng Sản phẩm tốt Ngôn ngữ Bài Tập javascript Ở đâu Thế nào Hướng dẫn Dịch Tại sao Máy tính Đại học