2024年5月23日
[LeetCode] 2831. Find the Longest Equal Subarray
摘要： You are given a 0-indexed integer array nums and an integer k. A subarray is called equal if all of its elements are equal. Note that the empty subarr 阅读全文
posted @ 2024-05-23 05:27 CNoodle 阅读(8) 评论(0) 推荐(0) 编辑