03 2025 档案

[LeetCode] 2226. Maximum Candies Allocated to K Children
摘要：You are given a 0-indexed integer array candies. Each element in the array denotes a pile of candies of size candies[i]. You can divide each pile into 阅读全文
posted @ 2025-03-14 12:35 CNoodle 阅读(29) 评论(0) 推荐(0) 编辑
[LeetCode] 3101. Count Alternating Subarrays
摘要：You are given a binary array nums. We call a subarray alternating if no two adjacent elements in the subarray have the same value. Return the number o 阅读全文
posted @ 2025-03-11 00:19 CNoodle 阅读(5) 评论(0) 推荐(0) 编辑
[LeetCode] 3208. Alternating Groups II
摘要：There is a circle of red and blue tiles. You are given an array of integers colors and an integer k. The color of tile i is represented by colors[i]: 阅读全文
posted @ 2025-03-10 11:20 CNoodle 阅读(12) 评论(0) 推荐(0) 编辑
[LeetCode] 2269. Find the K-Beauty of a Number
摘要：The k-beauty of an integer num is defined as the number of substrings of num when it is read as a string that meet the following conditions: It has a 阅读全文
posted @ 2025-03-10 06:45 CNoodle 阅读(4) 评论(0) 推荐(0) 编辑
[LeetCode] 2588. Count the Number of Beautiful Subarrays
摘要：You are given a 0-indexed integer array nums. In one operation, you can: Choose two different indices i and j such that 0 <= i, j < nums.length. Choos 阅读全文
posted @ 2025-03-06 01:08 CNoodle 阅读(14) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示