11 2023 档案

[LeetCode] 1685. Sum of Absolute Differences in a Sorted Array
摘要：You are given an integer array nums sorted in non-decreasing order. Build and return an integer array result with the same length as nums such that re 阅读全文
posted @ 2023-11-30 01:55 CNoodle 阅读(81) 评论(0) 推荐(0)
[LeetCode] 1727. Largest Submatrix With Rearrangements
摘要：You are given a binary matrix matrix of size m x n, and you are allowed to rearrange the columns of the matrix in any order. Return the area of the la 阅读全文
posted @ 2023-11-30 01:51 CNoodle 阅读(70) 评论(0) 推荐(0)
[LeetCode] 1424. Diagonal Traverse II
摘要：Given a 2D integer array nums, return all elements of nums in diagonal order as shown in the below images. Example 1: Input: nums = [[1,2,3],[4,5,6],[ 阅读全文
posted @ 2023-11-25 02:59 CNoodle 阅读(61) 评论(0) 推荐(0)
[LeetCode] 1630. Arithmetic Subarrays
摘要：A sequence of numbers is called arithmetic if it consists of at least two elements, and the difference between every two consecutive elements is the s 阅读全文
posted @ 2023-11-24 08:54 CNoodle 阅读(50) 评论(0) 推荐(0)
[LeetCode] 2563. Count the Number of Fair Pairs
摘要：Given a 0-indexed integer array nums of size n and two integers lower and upper, return the number of fair pairs. A pair (i, j) is fair if: 0 <= i < j 阅读全文
posted @ 2023-11-24 08:06 CNoodle 阅读(119) 评论(0) 推荐(0)
[LeetCode] 2824. Count Pairs Whose Sum is Less than Target
摘要：Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < 阅读全文
posted @ 2023-11-24 03:03 CNoodle 阅读(78) 评论(0) 推荐(0)
[LeetCode] 1410. HTML Entity Parser
摘要：HTML entity parser is the parser that takes HTML code as input and replace all the entities of the special characters by the characters itself. The sp 阅读全文
posted @ 2023-11-23 01:57 CNoodle 阅读(35) 评论(0) 推荐(0)
[LeetCode] 1647. Minimum Deletions to Make Character Frequencies Unique
摘要：A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of c 阅读全文
posted @ 2023-11-22 07:16 CNoodle 阅读(57) 评论(0) 推荐(0)
[LeetCode] 2216. Minimum Deletions to Make Array Beautiful
摘要：You are given a 0-indexed integer array nums. The array nums is beautiful if: nums.length is even. nums[i] != nums[i + 1] for all i % 2 == 0. Note tha 阅读全文
posted @ 2023-11-22 04:42 CNoodle 阅读(39) 评论(0) 推荐(0)
[LeetCode] 2785. Sort Vowels in a String
摘要：Given a 0-indexed string s, permute s to get a new string t such that: All consonants remain in their original places. More formally, if there is an i 阅读全文
posted @ 2023-11-14 10:38 CNoodle 阅读(65) 评论(0) 推荐(0)
[LeetCode] 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
摘要：There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge b 阅读全文
posted @ 2023-11-14 01:35 CNoodle 阅读(94) 评论(0) 推荐(0)
[LeetCode] 2849. Determine if a Cell Is Reachable at a Given Time
摘要：You are given four integers sx, sy, fx, fy, and a non-negative integer t. In an infinite 2D grid, you start at the cell (sx, sy). Each second, you mus 阅读全文
posted @ 2023-11-09 01:24 CNoodle 阅读(51) 评论(0) 推荐(0)
[LeetCode] 2609. Find the Longest Balanced Substring of a Binary String
摘要：You are given a binary string s consisting only of zeroes and ones. A substring of s is considered balanced if all zeroes are before ones and the numb 阅读全文
posted @ 2023-11-08 02:17 CNoodle 阅读(83) 评论(0) 推荐(0)
[LeetCode] 1535. Find the Winner of an Array Game
摘要：Given an integer array arr of distinct integers and an integer k. A game will be played between the first two elements of the array (i.e. arr[0] and a 阅读全文
posted @ 2023-11-05 13:48 CNoodle 阅读(85) 评论(0) 推荐(0)
[LeetCode] 2149. Rearrange Array Elements by Sign
摘要：You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers. You should rearrange the 阅读全文
posted @ 2023-11-04 13:13 CNoodle 阅读(81) 评论(0) 推荐(0)
[LeetCode] 2265. Count Nodes Equal to Average of Subtree
摘要：Given the root of a binary tree, return the number of nodes where the value of the node is equal to the average of the values in its subtree. Note: Th 阅读全文
posted @ 2023-11-03 07:02 CNoodle 阅读(63) 评论(0) 推荐(0)
[LeetCode] 2574. Left and Right Sum Differences
摘要：Given a 0-indexed integer array nums, find a 0-indexed integer array answer where: answer.length == nums.length. answer[i] = |leftSum[i] - rightSum[i] 阅读全文
posted @ 2023-11-01 03:58 CNoodle 阅读(58) 评论(0) 推荐(0)