Skip to main content

Python List Comprehension

Way to create a new list from iterable by transforming the items.

Syntax:


[ output_expression for item in iterable [ conditions ] ]

numbers = [1, 2, 3, 4, 5, 6]
squares = [number**2 for number in numbers]
print(squares)
#Output: [1, 4, 9, 16, 25, 36]

Using if condition


We can use if condition to filter out some elements.

numbers = [1, 2, 3, 4, 5, 6]
squares = [number**2 for number in numbers if number > 2]
print(squares)
#Output: [9, 16, 25, 36]

Using multiple if condition (ANDing)

We can use multiple if conditions to filter out elements. All if conditions will be ANDed

numbers = [1, 2, 3, 4, 5, 18, 30]
list_1 = [number for number in numbers
          if number % 2 == 0
          if number % 3 == 0]
print(list_1)
#Output: [18, 30]

Using ‘in’ statement (ORing)


'in' keyword can be used to create a condition statement.

numbers = [1, 2, 3, 4, 5, 18, 30]
list_2 = [number for number in numbers
          if number % 3 in (1, 2)]
print(list_2)
#Output: [1, 2, 4, 5]

Using if condition in output expression



If condition can be used to alter the resulting list.

numbers = [1, 2, 3, 4, 5]
list_3 = ["Even" if number % 2 == 0
          else "Odd" for number in numbers]
print(list_3)
#Output: ['Odd', 'Even', 'Odd', 'Even', 'Odd']

Using the if-else statement


Ladder of if-else statement can be used to alter the resulting list.

numbers = [25, 35, 50, 90]
list_4 = ["First" if number >= 60
          else "Second" if 45 <= number < 60
          else "Third" if 33 <= number < 45
          else "Failed"
          for number in numbers]
print(list_4)
# Output: ['Failed', 'Third', 'Second', 'First']

Nesting list comprehension


Nesting of list comprehension is just like the nested for loops.

list_6 = [[n for n in range(1, 4)] for number in range(3)]
print(list_6)
# Output: [[1, 2, 3], [1, 2, 3], [1, 2, 3]]

Dictionary comprehension


Dictionary comprehension works the same as lists. The difference is that we will work on (key, value) pairs.

dict_1 = {'a': 1, 'b': 3, 'c': 4}
dict_2 = {key: value**2 for key, value in dict_1.items()}
print(dict_2)
# Output: {'a': 2, 'b': 6, 'c': 8}

Set comprehension


Set can be created just like the list is comprehended.

numbers = [1, 2, 3, 4, 5]
set_1 = {number*2 for number in numbers}
print(set_1)
# Output: {2, 4, 6, 8, 10}

If you have some cool tricks regarding this topic, feel free to comment below. Thanks.
Labels:

Comments

Post a Comment

Popular posts from this blog

Link List

In computer science, a linked list is a linear collection of elements, called nodes, each node have info field and next field pointing to the next node by means of a pointer. It is a data structure consisting of a group of nodes in sequence and connected with links. In simplest form of this data structure, each node is consist of data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. Types of Link List Singly Link List: Insert node at first position in singly link list Insert node at last position in singly link list Insert node at specific position in singly link list Delete node at first position in singly link list Delete node at last position in singly link list Delete node at specific position in singly link list Find number of nodes in singly link list Dublication of singly link list Concatenation of two singly link list So...
Post a Comment
Read more

Deletion of node at specific position N in circular link list

Now we will see how to delete node at position 'N' in circular link list. Algorithm to delete node at position 'N' in circular link list: In this algorithm, TAIL points to last node of the link list and POS is position where the new node to be deleted. The steps are as follows: Initialize TEMP and TEMP2 If list have no node or position is less than one  (TAIL == NULL or POS < 1) Node cannot be deleted Else If (POS == 1) If list have one node   (TAIL->NEXT == TAIL) Delete TAIL   (TAIL = NULL) Else Delete the first node   (TAIL->NEXT = TAIL->NEXT->NEXT) End If; Else Set TEMP = TAIL->NEXT   (TEMP now points to first node) Traverse the list for (POS-1)th node using TEMP If node to be deleted is last node i.e. (TEMP->NEXT == TAIL) Set TAIL = TEMP End If; Set TEMP->NEXT = TEMP->NEXT->NEXT End If; End If;     Function to delete node at position 'N' in circular link list: int deleteAtPosition(NODE **tail, ...
Post a Comment
Read more

Deletion of first node in circular link list

Deletion of first node from the circular link list requires that the list has at least one node. It is error to delete a node doesn't exist. In this process, last node's next pointer is updated to point to second node of the list. Now we will see the algorithm to delete node at first position in circular link list. Algorithm to delete first node in circular link list: The algorithm uses TAIL as pointer to the last node of circular list and TEMP is temporary pointer that help in deletion process. The steps are as follows: Declare TEMP If list have only one node FREE (TAIL) TAIL = NULL Else TEMP = TAIL->NEXT  [TEMP will point to first node] TAIL->NEXT = TAIL->NEXT->NEXT [TAIL's next will now point to second node] Free (TEMP) [free the first node] End If; Function to delete node at first position in circular link list: The function takes pointer to last node as input and return info part of the list if no error occur, otherwise returns -1 after printi...
Post a Comment
Read more