Python – Convert Tuple String to Integer Tuple

Interconversion of data is a popular problem developer generally deal with. One can face a problem to convert tuple string to integer tuple. Let’s discuss certain ways in which this task can be performed. 

Method #1 : Using tuple() + int() + replace() + split() The combination of above methods can be used to perform this task. In this, we perform the conversion using tuple() and int(). Extraction of elements is done by replace() and split(). 

The original string is : (7, 8, 9)
The tuple after conversion is : (7, 8, 9)

Time complexity: O(n), where n is the length of the input string.
Auxiliary space: O(n), as we are creating a new tuple with the same number of elements as the input string.

Method #2: Using eval() This is recommended method to solve this task. This performs the interconversion task internally. 

The original string is : (7, 8, 9)
The tuple after conversion is : (7, 8, 9)

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

Method #3: Using map()

Original tuple is : ('1', '4', '3', '6', '7')
Modified tuple is : (1, 4, 3, 6, 7)

Method: Using the list comprehension 

(1, 4, 3, 6, 7)

Method: Using enumerate function 

(1, 4, 3, 6, 7)

Method: Using lambda function

(1, 4, 3, 6, 7)

Method: Using ast

The original string is : (7, 8, 9)
The tuple after conversion is : (7, 8, 9)

Time complexity: The time complexity of this code is O(1) because the string length is fixed and does not depend on the input size.

Auxiliary space complexity: The space complexity of this code is O(1) because the input and output are stored in constant space, and the ast module does not use any significant extra memory.

Method: Using for loop and append

(1, 2, 3, 4)

The ast module provides the literal_eval function which evaluates a string containing a literal value and returns the value. In this case, we can pass in the string representation of a tuple, and literal_eval will return the actual tuple.

Time complexity: O(n), where n is the length of the input string.

Auxiliary Space: O(n), where n is the length of the input string.

Method : Using a for loop

In this code, we iterate through each character in the input string. If the character is a digit, we add it to a temporary string. When we encounter a non-digit character, we check if the temporary string has any digits in it. If it does, we convert the temporary string to an integer and add it to the result list. Finally, we convert the result list to a tuple and print it.

The tuple after conversion is : (7, 8, 9)

Time complexity: The time complexity of the for loop method is O(n), where n is the length of the input string. This is because the for loop iterates through each character of the string only once and performs a constant number of operations for each character.

Method: Using Recursive method.

Auxiliary Space: The space complexity of the for loop method is O(n), where n is the length of the input string. This is because the method creates a list to store the integer values extracted from the string, and the size of this list is proportional to the length of the string. 

Algorithm:

1. Define a helper function to recursively process the string and build the tuple.
2. The helper function takes two arguments: the current index in the string, and a temporary string to store digits.
3. The helper function checks if the current character at the given index is a digit.
4. If it is a digit, it is added to the temporary string and the helper function is called again with the next index and the updated temporary string.
5. If it is not a digit, the temporary string is converted to an integer and appended to the result list.
6. Finally, the helper function returns the result tuple.
7. The main function calls the helper function with the initial index and an empty temporary string.
8. The main function returns the result tuple.

The tuple after conversion is : (7, 8, 9)

The time complexity of this algorithm is O(n), where n is the length of the input string. This is because each character in the string is visited exactly once. 

The space complexity is also O(n), as the result list may contain n elements at most. However, in practice, the space complexity is likely to be much smaller as most tuples are likely to contain only a few elements.

Method: Using numpy package

Note: first install numpy package by using : pip install numpy

• Importing the numpy package
• Using the astype() in numpy array to convert each element integer using np.array()
• Converting the numpy array to tuple 
• Printing the result

Output

Original tuple is : ('1', '4', '3', '6', '7')
Modified tuple is : (1, 4, 3, 6, 7)

Time Complexity: O(N) as we have to traverse the whole tuple of length N
Auxiliary Space: O(N) as we are creating array of length N.

manjeet_04

Follow

Improve