Checkout Algorithm Series, questions are arranged by categories (-)

Problem List

Retrived from Leetcode Top 100 Liked (2022.01.25)

题解形式

888. 题目昵称

https://leetcode-cn.com/problems/题目的Leetcode链接

题目重点的描述，可以提供理解

class Solution:
    def someProblem(self, arg1: List[int], arg2: int) -> List[int]:
        # Some solution

一些解释、和对时间复杂度的分析 $\mathcal{O}(n!)$