LeetCode - 随笔分类(第2页) - onlyblues

The Number of Good Subsets

摘要：The Number of Good Subsets You are given an integer array nums . We call a subset of nums good if its product can be represented as a product of one o 阅读全文

posted @ 2023-02-19 19:41 onlyblues 阅读(52) 评论(0) 推荐(0) 编辑

Count the Number of Square-Free Subsets

摘要：Count the Number of Square-Free Subsets You are given a positive integer 0-indexed array nums . A subset of the array nums is square-free if the produ 阅读全文

posted @ 2023-02-19 18:53 onlyblues 阅读(56) 评论(0) 推荐(0) 编辑

Handling Sum Queries After Update

摘要：Handling Sum Queries After Update You are given two 0-indexed arrays nums1 and nums2 and a 2D array queries of queries. There are three types of queri 阅读全文

posted @ 2023-02-19 10:16 onlyblues 阅读(19) 评论(0) 推荐(0) 编辑

Subsequence With the Minimum Score

摘要：Subsequence With the Minimum Score You are given two strings

s

$s$ and

t

$t$ . You are allowed to remove any number of characters from the string t. The s 阅读全文

posted @ 2023-02-12 22:54 onlyblues 阅读(22) 评论(0) 推荐(0) 编辑

Substring XOR Queries

摘要：Substring XOR Queries You are given a binary string s , and a 2D integer array queries where queries[i] = [firsti, secondi] . For the ith query, find 阅读全文

posted @ 2023-02-12 15:49 onlyblues 阅读(23) 评论(0) 推荐(0) 编辑

Count the Number of Fair Pairs

摘要：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 pa 阅读全文

posted @ 2023-02-12 15:28 onlyblues 阅读(64) 评论(0) 推荐(0) 编辑

Disconnect Path in a Binary Matrix by at Most One Flip

摘要：Disconnect Path in a Binary Matrix by at Most One Flip You are given a 0-indexed

m \times n

$m \times n$ binary matrix grid . You can move from a cell (row, col) 阅读全文

posted @ 2023-02-05 18:16 onlyblues 阅读(36) 评论(0) 推荐(0) 编辑

Maximize Win From Two Segments

摘要：Maximize Win From Two Segments There are some prizes on the X-axis. You are given an integer array prizePositions that is sorted in non-decreasing ord 阅读全文

posted @ 2023-02-05 16:08 onlyblues 阅读(25) 评论(0) 推荐(0) 编辑

Minimum Cost to Make Array Equal

摘要：Minimum Cost to Make Array Equal You are given two 0-indexed arrays nums and cost consisting each of

n

$n$ positive integers. You can do the following o 阅读全文

posted @ 2023-02-02 23:12 onlyblues 阅读(72) 评论(0) 推荐(0) 编辑

Count Increasing Quadruplets

摘要：Count Increasing Quadruplets Given a 0-indexed integer array nums of size

n

$n$ containing all numbers from

1

$1$ to

n

$n$ , return the number of increasing 阅读全文

posted @ 2023-02-02 19:36 onlyblues 阅读(34) 评论(0) 推荐(0) 编辑

Put Marbles in Bags

摘要：Put Marbles in Bags You have k bags. You are given a 0-indexed integer array weights where weights[i] is the weight of the ith marble. You are also gi 阅读全文

posted @ 2023-02-01 18:00 onlyblues 阅读(65) 评论(0) 推荐(0) 编辑

Rank Transform of a Matrix

摘要：Rank Transform of a Matrix Given an m x n matrix , return a new matrix answer where answer[row][col] is the rank of matrix[row][col] . The rank is an 阅读全文

posted @ 2023-01-25 16:47 onlyblues 阅读(30) 评论(0) 推荐(0) 编辑

Minimum Cost to Split an Array

摘要：Minimum Cost to Split an Array You are given an integer array nums and an integer

k

$k$ . Split the array into some number of non-empty subarrays. The co 阅读全文

posted @ 2023-01-22 12:51 onlyblues 阅读(32) 评论(0) 推荐(0) 编辑

Difference Between Maximum and Minimum Price Sum

摘要：Difference Between Maximum and Minimum Price Sum There exists an undirected and initially unrooted tree with

n

$n$ nodes indexed from

0

$0$ to

n - 1

$n - 1$ . Yo 阅读全文

posted @ 2023-01-18 12:15 onlyblues 阅读(44) 评论(0) 推荐(0) 编辑

Maximize the Minimum Powered City

摘要：Maximize the Minimum Powered City You are given a 0-indexed integer array stations of length

n

$n$ , where stations[i] represents the number of power sta 阅读全文

posted @ 2023-01-13 16:05 onlyblues 阅读(26) 评论(0) 推荐(0) 编辑

Number of Great Partitions

摘要：Number of Great Partitions You are given an array nums consisting of positive integers and an integer k . Partition the array into two ordered groups 阅读全文

posted @ 2023-01-12 23:18 onlyblues 阅读(21) 评论(0) 推荐(0) 编辑

Count Pairs With XOR in a Range

摘要：Count Pairs With XOR in a Range Given a (0-indexed) integer array nums and two integers low and high , return the number of nice pairs. A nice pair is 阅读全文

posted @ 2023-01-12 16:45 onlyblues 阅读(45) 评论(0) 推荐(0) 编辑

Maximum Number of Points From Grid Queries

摘要：Maximum Number of Points From Grid Queries You are given an

m \times n

$m \times n$ integer matrix grid and an array queries of size

k

$k$ . Find an array answer of 阅读全文

posted @ 2023-01-11 17:24 onlyblues 阅读(32) 评论(0) 推荐(0) 编辑

Frog Jump II

摘要：Frog Jump II You are given a 0-indexed integer array stones sorted in strictly increasing order representing the positions of stones in a river. A fro 阅读全文

posted @ 2023-01-11 10:15 onlyblues 阅读(42) 评论(0) 推荐(0) 编辑

Add Edges to Make Degrees of All Nodes Even

摘要：Add Edges to Make Degrees of All Nodes Even There is an undirected graph consisting of

n

$n$ nodes numbered from

1

$1$ to

n

$n$ . You are given the integer $ 阅读全文

posted @ 2022-12-18 17:31 onlyblues 阅读(19) 评论(0) 推荐(0) 编辑

onlyblues

随笔分类 - LeetCode

公告

搜索

常用链接

随笔分类

随笔档案

阅读排行榜

推荐排行榜

最新评论