04 2023 档案

[LeetCode] 1033. Moving Stones Until Consecutive
摘要：There are three stones in different positions on the X-axis. You are given three integers a, b, and c, the positions of the stones. In one move, you p 阅读全文
posted @ 2023-04-30 03:41 CNoodle 阅读(46) 评论(0) 推荐(0)
[LeetCode] 1031. Maximum Sum of Two Non-Overlapping Subarrays
摘要：Given an integer array nums and two integers firstLen and secondLen, return the maximum sum of elements in two non-overlapping subarrays with lengths 阅读全文
posted @ 2023-04-28 01:40 CNoodle 阅读(81) 评论(0) 推荐(0)
[LeetCode] 2336. Smallest Number in Infinite Set
摘要：You have a set which contains all positive integers [1, 2, 3, 4, 5, ...]. Implement the SmallestInfiniteSet class: SmallestInfiniteSet() Initializes t 阅读全文
posted @ 2023-04-26 01:56 CNoodle 阅读(183) 评论(0) 推荐(0)
[LeetCode] 2418. Sort the People
摘要：You are given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n. For each index 阅读全文
posted @ 2023-04-25 23:39 CNoodle 阅读(86) 评论(0) 推荐(0)
[LeetCode] 1372. Longest ZigZag Path in a Binary Tree
摘要：You are given the root of a binary tree. A ZigZag path for a binary tree is defined as follow: Choose any node in the binary tree and a direction (rig 阅读全文
posted @ 2023-04-22 06:59 CNoodle 阅读(243) 评论(0) 推荐(0)
[LeetCode] 1042. Flower Planting With No Adjacent
摘要：You have n gardens, labeled from 1 to n, and an array paths where paths[i] = [xi, yi] describes a bidirectional path between garden xi to garden yi. I 阅读全文
posted @ 2023-04-16 01:54 CNoodle 阅读(63) 评论(0) 推荐(0)
[LeetCode] 2390. Removing Stars From a String
摘要：You are given a string s, which contains stars *. In one operation, you can: Choose a star in s. Remove the closest non-star character to its left, as 阅读全文
posted @ 2023-04-11 12:46 CNoodle 阅读(200) 评论(0) 推荐(0)
[LeetCode] 2405. Optimal Partition of String
摘要：Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears i 阅读全文
posted @ 2023-04-04 23:31 CNoodle 阅读(96) 评论(0) 推荐(0)
[LeetCode] 2300. Successful Pairs of Spells and Potions
摘要：You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell 阅读全文
posted @ 2023-04-03 05:23 CNoodle 阅读(210) 评论(0) 推荐(0)