【Python】 3.17

[哈夫曼树_]

题目: 509. 斐波那契数 - 力扣（Leetcode）

class Solution:
    def fib(self, n: int) -> int:
        dp = [1] * (n + 1)
        dp[0] = 0
        for i in range (2, n + 1):
            dp[i] = dp[i - 1] + dp[i - 2]
        return dp[n]

 

题目:  537. 复数乘法 - 力扣（Leetcode）

class Solution:
    def complexNumberMultiply(self, num1: str, num2: str) -> str:
        real1, imag1 = map(int,num1[:-1].split('+'))
        real2, imag2 = map(int,num2[:-1].split('+'))
        real3 = real1 * real2 - imag1 * imag2
        imag3 = real1 * imag2 + real2 * imag1
        return ("{}+{}i").format(real3, imag3)