--- tags: AC LeetCode 刷題讀書會 - 2023 --- # 2023/10/15 (日) 每週 LeetCode 刷題 ## 刷題題號 - [347. Top K Frequent Elements](https://leetcode.com/problems/climbing-stairs/) ## 解題思路 Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. <pre style='background-color:#ggg'> 給予一個整數陣列 nums 和一個整數 k,回傳 k 個最頻繁的元素。你可以回傳任何順序的答案。 </pre> ## 回報格式 - 請 Fork 此 Replit 連結(https://replit.com/@AllenLi23/AC-LeetCode-Js-347-Top-K-Frequent-Elements)後,進行程式碼解題,並於完成後更新到 Replit 中,再將連結貼至「解題分享區」來與大家交流做法。 解題分享區 --- 讀書會議流程: #簽到表: https://docs.google.com/spreadsheets/d/1gc16rrF-yZNs845z_nYrdgDIiSECOJok30dNLyQm69A/edit#gid=534323210 1. 題目說明。 2. 題目解析(BigO(n * log(m)))。 4. 成員分享解題思路。 5. 問題與討論。 <!-- No.0 (請依序排序下去) name: name (回報範例) lighthouse: lighthouse Replit:https://replit.com/@AllenLi23/AC-LeetCode-Js-347-Top-K-Frequent-Elements-Allen --> <!-- No.1 name: Kai lighthouse: pythonforeye@gmail.com Replit: https://replit.com/@Beginneraboutli/AC-LeetCode-Js-347-Top-K-Frequent-Elements#index.js --> <!-- No.2 name: Jack Hung lighthouse: lhhungx@gmail.com Replit:https://replit.com/@LungHsuanHung/AC-LeetCode-Go-347-Top-K-Frequent-Elements#solution/solution.go -->
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up