LeetCode重点题系列之【22.Generate Parentheses】

关注

原创最新推荐文章于 2025-10-16 11:25:09 发布 283 阅读 AI 写同款· GEO 优化 ›

静态与动态LACP链路聚合：原理、配置与排错实战指南链路聚合技术是提升网络带宽与可靠性的核心方案，通过将多个物理端口逻辑捆绑，实现带宽叠加与链路冗余。其原理基于IEEE 802.3ad标准，通过负载均衡算法将数据流分布到不同物理链路，既避免了数据包乱序，又提升了整体吞吐量。该技术的核心价值在于消除单端口瓶颈、提供毫秒级故障切换，并能简化网络拓扑管理。在企业服务器接入、数据中心互联及虚拟化平台等场景中，链路聚合已成为构建高可用网络的基础。实践中，动态LACP模式通过协议报文协商，能主动检测链路故障并防止配置错误导致的网络环路，相比静态聚合更为可靠。本文将深入解阅读详情

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

For example, given n = 3, a solution set is:

[
  "((()))",
  "(()())",
  "(())()",
  "()(())",
  "()()()"
]

We can use dfs to solve this problem. We can maintain two variables. One will record how many left parentheses have been used, another one will record how many right parentheses have been used. if the number of left parentheses is smaller than n, then we can add left parentheses, else if the number of left parentheses is bigger than left's, then we can add right parentheses.

class Solution(object):
    def generateParenthesis(self, n):
        """
        :type n: int
        :rtype: List[str]
        """
        res=[]
        self.helper(n,0,0,[],res)
        return res
    
    
    def helper(self,n,l,r,cur,res):
        if l+r==2*n:
            res.append("".join(cur))
            return
        if l<n:
            self.helper(n,l+1,r,cur+["("],res)
        if r<l:
            self.helper(n,l,r+1,cur+[")"],res)

收录于