length = len(string1) %3D length2 = len(string2) %3D max_len = max (length, length2) II II string %3D if length == 1: string1 = string1 * max_len elif length2 ニ= 1: string2 = string2 * max_len elif...


use while loop instead of for loop



length = len(string1)<br>%3D<br>length2 =<br>len(string2)<br>%3D<br>max_len =<br>max (length, length2)<br>II II<br>string<br>%3D<br>if length<br>== 1:<br>string1 = string1 * max_len<br>elif length2<br>ニ= 1:<br>string2 = string2 * max_len<br>elif length > length2:<br>temporary = string2<br>for i in range (max_len):<br>temporary += string2[:-1][::-1] + string2[1:]<br>string2 = temporary[:max_len]<br>%3D<br>elif length2 > length:<br>temporary = string1<br>for i in range (max_len):<br>temporary += string1[:-1][::-1] + string1[1:]<br>string1 = temporary[:max_len]<br>for i in range (max_len):<br>string += string1[i] + string2[i]<br>return string<br>

Extracted text: length = len(string1) %3D length2 = len(string2) %3D max_len = max (length, length2) II II string %3D if length == 1: string1 = string1 * max_len elif length2 ニ= 1: string2 = string2 * max_len elif length > length2: temporary = string2 for i in range (max_len): temporary += string2[:-1][::-1] + string2[1:] string2 = temporary[:max_len] %3D elif length2 > length: temporary = string1 for i in range (max_len): temporary += string1[:-1][::-1] + string1[1:] string1 = temporary[:max_len] for i in range (max_len): string += string1[i] + string2[i] return string
def loopy_madness(string1: str, string2: str) -> str:<br>Given two strings <string1> and <string2>, return a new string that<br>contains letters from these two strings . If the two strings are not of equal length, then start looping "backwards-and-forwards" in the shorter string until you come to the end of the longer string. "interwoven" (or "interweaving") means constructing a new string by taking the first letter from the first string, adding the first letter of the second string, adding the second letter of the first string, adding the second letter of the second string, and so on. "backwards-and-forwards" is a custom looping term. First the loop starts at position 1 (index 0) and goes until position n (i.e., the end). Once the Loop reaches position n, it goes backwards, starting at positionn- 1 and goes to position 1 (index 0). This repeats until the two strings are interwoven. For example, the backwards-and-forwards operations of "abc" would be "abcbabcba..." wwww Examples: If you are given "abc" and "123", then the output string is "alb2c3". This is after taking "a" from the first string, adding "1" from the second string, adding "b" from the first string, and so on. Things get more interesting when you are given two strings that differ in length. For example, if you are given "abcde" and "12", then the wwwwwww output would be "alb2c1d2e1". Notice how the shorter string loops around when it runs out of characters, and continues looping until the longer string is exhausted. "/>
Extracted text: def loopy_madness(string1: str, string2: str) -> str: Given two strings and , return a new string that contains letters from these two strings "interwoven" together, starting with the first character of . If the two strings are not of equal length, then start looping "backwards-and-forwards" in the shorter string until you come to the end of the longer string. "interwoven" (or "interweaving") means constructing a new string by taking the first letter from the first string, adding the first letter of the second string, adding the second letter of the first string, adding the second letter of the second string, and so on. "backwards-and-forwards" is a custom looping term. First the loop starts at position 1 (index 0) and goes until position n (i.e., the end). Once the Loop reaches position n, it goes backwards, starting at positionn- 1 and goes to position 1 (index 0). This repeats until the two strings are interwoven. For example, the backwards-and-forwards operations of "abc" would be "abcbabcba..." wwww Examples: If you are given "abc" and "123", then the output string is "alb2c3". This is after taking "a" from the first string, adding "1" from the second string, adding "b" from the first string, and so on. Things get more interesting when you are given two strings that differ in length. For example, if you are given "abcde" and "12", then the wwwwwww output would be "alb2c1d2e1". Notice how the shorter string loops around when it runs out of characters, and continues looping until the longer string is exhausted.

Jun 07, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here