07 2025 档案

[LeetCode] 2044. Count Number of Maximum Bitwise-OR Subsets
摘要：Given an integer array nums, find the maximum possible bitwise OR of a subset of nums and return the number of different non-empty subsets with the ma 阅读全文
posted @ 2025-07-28 06:46 CNoodle 阅读(41) 评论(0) 推荐(0)
[LeetCode] 2210. Count Hills and Valleys in an Array
摘要：You are given a 0-indexed integer array nums. An index i is part of a hill in nums if the closest non-equal neighbors of i are smaller than nums[i]. S 阅读全文
posted @ 2025-07-27 04:37 CNoodle 阅读(10) 评论(0) 推荐(0)
[LeetCode] 815. Bus Routes
摘要：You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever. For example, if routes[0] = [1, 阅读全文
posted @ 2025-07-22 13:12 CNoodle 阅读(28) 评论(0) 推荐(0)
[LeetCode] 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points
摘要：A critical point in a linked list is defined as either a local maxima or a local minima. A node is a local maxima if the current node has a value stri 阅读全文
posted @ 2025-07-21 13:03 CNoodle 阅读(24) 评论(0) 推荐(0)
[LeetCode] 3201. Find the Maximum Length of Valid Subsequence I
摘要：You are given an integer array nums. A subsequence sub of nums with length x is called valid if it satisfies: (sub[0] + sub[1]) % 2 == (sub[1] + sub[2 阅读全文
posted @ 2025-07-16 04:55 CNoodle 阅读(72) 评论(0) 推荐(0)
[LeetCode] 3136. Valid Word
摘要：A word is considered valid if: It contains a minimum of 3 characters. It contains only digits (0-9), and English letters (uppercase and lowercase). It 阅读全文
posted @ 2025-07-15 09:15 CNoodle 阅读(39) 评论(0) 推荐(0)
[LeetCode] 2410. Maximum Matching of Players With Trainers
摘要：You are given a 0-indexed integer array players, where players[i] represents the ability of the ith player. You are also given a 0-indexed integer arr 阅读全文
posted @ 2025-07-14 12:29 CNoodle 阅读(15) 评论(0) 推荐(0)
[LeetCode] 3330. Find the Original Typed String I
摘要：Alice is attempting to type a specific string on her computer. However, she tends to be clumsy and may press a key for too long, resulting in a charac 阅读全文
posted @ 2025-07-01 05:13 CNoodle 阅读(143) 评论(0) 推荐(1)