討論串[閒聊] 每日LeetCode
共 719 篇文章
內容預覽:
這不就是 heapq.nlargest 嗎. 哈哈哈哈. 哈哈哈哈哈哈哈. class Solution:. def topKFrequent(self, words: List[str], k: int) -> List[str]:. counts = Counter(words). topk =
(還有213個字)
內容預覽:
692. Top K Frequent Words. 給予一個字串陣列words和一個數字k,返回出現頻率最高的k種字串列表,若多個字串. 出現次數相同,則字母順序較大的優先。. Input: words = ["i","love","leetcode","i","love","coding"],
(還有871個字)
內容預覽:
哈哈 這不就是 groupby 嗎. 哈哈哈哈哈哈. class Solution:. def countAndSay(self, n: int) -> str:. count, say = '1', ''. for i in range(n-1):. for k, v in groupby(cou
(還有84個字)
內容預覽:
38. Count and Say. 數數之後組成下一個字串,直接看例子:. https://assets.leetcode.com/uploads/2020/10/23/countandsay.jpg. n = 1: return 1 is the base case. n = 2: return
(還有1071個字)
內容預覽:
Count and say. 題目要算數字個數. 例如11 就是兩個1所以答案21. 21就是 1個2 1個1 所以1211. 就迴圈硬解. class Solution {. public:. string countAndSay(int n) {. string ans = "1";. int
(還有348個字)