Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.
用 AI 当教练，把 LeetCode 从“刷题”变成“系统化学习”。 本仓库收录我在 AI（GitHub Copilot / Claude）辅助下整理的 LeetCode 题解笔记。 重点不是“题做出来”，而是沉淀解题模板 + 提升主动回忆能力 ...
Getting good at LeetCode Java can feel like a puzzle sometimes, right? You see all these problems, and you’re not sure where to even start. This guide is here to break down the common approaches and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results