03 2023 档案

[LeetCode] 2068. Check Whether Two Strings are Almost Equivalent
摘要：Two strings word1 and word2 are considered almost equivalent if the differences between the frequencies of each letter from 'a' to 'z' between word1 a 阅读全文
posted @ 2023-03-28 04:52 CNoodle 阅读(149) 评论(0) 推荐(0)
[LeetCode] 2316. Count Unreachable Pairs of Nodes in an Undirected Graph
摘要：You are given an integer n. There is an undirected graph with n nodes, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] 阅读全文
posted @ 2023-03-26 03:45 CNoodle 阅读(98) 评论(0) 推荐(0)
[LeetCode] 1032. Stream of Characters
摘要：Design an algorithm that accepts a stream of characters and checks if a suffix of these characters is a string of a given array of strings words. For 阅读全文
posted @ 2023-03-25 01:03 CNoodle 阅读(37) 评论(0) 推荐(0)
[LeetCode] 2348. Number of Zero-Filled Subarrays
摘要：Given an integer array nums, return the number of subarrays filled with 0. A subarray is a contiguous non-empty sequence of elements within an array. 阅读全文
posted @ 2023-03-21 10:58 CNoodle 阅读(80) 评论(0) 推荐(0)
[LeetCode] 958. Check Completeness of a Binary Tree
摘要：Given the root of a binary tree, determine if it is a complete binary tree. In a complete binary tree, every level, except possibly the last, is compl 阅读全文
posted @ 2023-03-15 12:45 CNoodle 阅读(96) 评论(0) 推荐(0)
[LeetCode] 1590. Make Sum Divisible by P
摘要：Given an array of positive integers nums, remove the smallest subarray (possibly empty) such that the sum of the remaining elements is divisible by p. 阅读全文
posted @ 2023-03-10 11:38 CNoodle 阅读(265) 评论(0) 推荐(0)
[LeetCode] 2379. Minimum Recolors to Get K Consecutive Black Blocks
摘要：You are given a 0-indexed string blocks of length n, where blocks[i] is either 'W' or 'B', representing the color of the ith block. The characters 'W' 阅读全文
posted @ 2023-03-09 01:38 CNoodle 阅读(127) 评论(0) 推荐(0)
[LeetCode] 2187. Minimum Time to Complete Trips
摘要：You are given an array time where time[i] denotes the time taken by the ith bus to complete one trip. Each bus can make multiple trips successively; t 阅读全文
posted @ 2023-03-08 06:50 CNoodle 阅读(145) 评论(0) 推荐(0)