Python uses itertools module to solve algorithm problems

Rearrange the array

Give you an array nums, there are 2n elements in the array, arranged in the format [x1,x2,...,xn,y1,y2,...,yn].

Please rearrange the array in the format [x1,y1,x2,y2,…,xn,yn] and return the rearranged array.

Example 1:

Input: nums = [2,5,1,3,4,7], n = 3
Output: [2,3,5,4,1,7]
Explanation: Since x1=2, x2=5, x3=1 , y1=3, y2=4, y3=7, so the answer is [2,3,5,4,1,7]
Example 2:

Input: nums = [1,2,3,4,4,3,2,1], n = 4
Output: [1,4,2,3,3,2,4,1]
Example 3:

Input: nums = [1,1,2,2], n = 2
Output: [1,2,1,2]

code show as below:

from itertools import chain
from typing import List

class Solution:
    def shuffle(self, nums: List[int], n: int) -> List[int]:
        return list(chain(*zip(nums[:n], nums[n:])))

Dynamic sum of one-dimensional arrays

Give you an array of nums. The calculation formula for the "dynamic sum" of the array is: runningSum[i] = sum(nums[0]…nums[i]).

Please return the dynamic sum of nums.

Example 1:

Input: nums = [1,2,3,4]
Output: [1,3,6,10]
Explanation: The dynamic and calculation process is [1, 1+2, 1+2+3, 1+2+3+ 4].
Example 2:

Input: nums = [1,1,1,1,1]
Output: [1,2,3,4,5]
Explanation: The dynamic and calculation process is [1, 1+1, 1+1+1, 1+ 1+1+1, 1+1+1+1+1].
Example 3:

Input: nums = [3,1,2,10,1]
Output: [3,4,6,16,17]

code show as below

from itertools import accumulate
from typing import List

class Solution:
    def runningSum(self, nums: List[int]) -> List[int]:
        return list(accumulate(nums))

Guess you like

Origin blog.csdn.net/weixin_43372169/article/details/110380466