Как найти количество нечетных чисел в питоне

Given a list of numbers, write a Python program to count Even and Odd numbers in a List.

Example:

Input: list1 = [2, 7, 5, 64, 14]
Output: Even = 3, odd = 2

Input: list2 = [12, 14, 95, 3]
Output: Even = 2, odd = 2

Example 1: 

Count Even and Odd numbers from the given list using for loop Iterate each element in the list using for loop and check if num % 2 == 0, the condition to check even numbers. If the condition satisfies, then increase the even count else increase odd count. 

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Example 2: Using while loop 

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Example 3: Using Python Lambda Expressions 

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(n)
Space Complexity: O(1)

Example 4: Using List Comprehension 

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Example 5: Using Recursion

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Example 6: Using Bitwise XOR operator

The idea is to check whether the last bit of the number is set or not. If the last bit is set then the number is odd, otherwise even. As we know bitwise XOR Operation of the Number by 1 increments the value of the number by 1 if the number is even otherwise it decrements the value of the number by 1 if the value is odd.

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Example 7: Using Bitwise AND operator

The idea is to check whether the last bit of the number is set or not. If the last bit is set then the number is odd, otherwise even.
As we know bitwise AND Operation of the Number by 1 will be 1, If it is odd because the last bit will be already set. Otherwise, it will give 0 as output. 

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Example 8: Using Bitwise OR operator

The idea is to check whether the last bit of the number is set or not. If the last bit is set then the number is odd, otherwise even. As we know bitwise OR Operation of the Number by 1 increment the value of the number by 1 if the number is even otherwise it will remain unchanged. So, if after OR operation of number with 1 gives a result which is greater than the number then it is even and we will return true otherwise it is odd and we will return false.

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Method: Using the enumerate function 

even number count 2 odd number count 2

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Method: Using Numpy.Array : 

Output:

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(N), Here N is the number of elements in the list.
Auxiliary Space: O(1), As constant extra space is used.

Method: Using Numpy.where() function : 

note: install numpy module using command “pip install numpy”

Algorithm:

Convert the given list to a numpy array.
Use numpy.where() function to find the indices of even and odd numbers in the array.
Count the number of indices using the len() function.
Print the counts.

Here’s the Python program to count Even and Odd numbers in a List using numpy.where() function:

Output:

Even numbers in the list:  3
Odd numbers in the list:  2

Time Complexity: O(N), where N is the number of elements in the list.
Space Complexity: O(N), as we create a numpy array of size N.

Method: Using Sum and len function  

Approach: 

• Initialize list. 
• Initialize even_count and odd_count variables to store numbers. 
• Use Sum method which counts 1 if the number in the list is odd and store the result in odd_count. 
• Subtract the total length list to odd_count and store the value in even_count. 
• Print event_count and odd_count. 

Output:

Even numbers in the list:  3
Odd numbers in the list:  4

Time Complexity: O(n), where n is the length of the list.
Space Complexity: O(1), Because no extra space is used.

Перейти к содержанию

number = int(input('Введите число: '))
# Для чётных цифр
even = 0
# Для нечётных цифр
odd = 0

number = int(input('Введите число: '))

even = 0
odd = 0

while number > 0:

number = int(input('Введите число: '))

even = 0
odd = 0

while number > 0:
    if number % 2 == 0:
        even += 1
    else:
        odd += 1

number = int(input('Введите число: '))

even = 0
odd = 0

while number > 0:
    if number % 2 == 0:
        even += 1
    else:
        odd += 1
    number = number // 10

number = int(input('Введите число: '))

even = 0
odd = 0

while number > 0:
    if number % 2 == 0:
        even += 1
    else:
        odd += 1
    number = number // 10

print(f'Количество чётных цифр: {even}')
print(f'Количество нечётных цифр: {odd}')