2021年8月18日
[LeetCode] 1963. Minimum Number of Swaps to Make the String Balanced
摘要： You are given a 0-indexed string s of even length n. The string consists of exactly n / 2 opening brackets '[' and n / 2 closing brackets ']'. A strin 阅读全文
posted @ 2021-08-18 23:41 CNoodle 阅读(470) 评论(0) 推荐(0)