09 2023 档案

[LeetCode] 2582. Pass the Pillow
摘要：There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holdin 阅读全文
posted @ 2023-09-26 13:45 CNoodle 阅读(71) 评论(0) 推荐(0)
[LeetCode] 1222. Queens That Can Attack the King
摘要：On a 0-indexed 8 x 8 chessboard, there can be multiple black queens ad one white king. You are given a 2D integer array queens where queens[i] = [xQue 阅读全文
posted @ 2023-09-16 05:13 CNoodle 阅读(52) 评论(0) 推荐(0)
[LeetCode] 2596. Check Knight Tour Configuration
摘要：There is a knight on an n x n chessboard. In a valid configuration, the knight starts at the top-left cell of the board and visits every cell on the b 阅读全文
posted @ 2023-09-16 02:10 CNoodle 阅读(63) 评论(0) 推荐(0)
[LeetCode] 1383. Maximum Performance of a Team
摘要：You are given two integers n and k and two integer arrays speed and efficiency both of length n. There are n engineers numbered from 1 to n. speed[i]  阅读全文
posted @ 2023-09-08 05:58 CNoodle 阅读(59) 评论(0) 推荐(0)
[LeetCode] 2594. Minimum Time to Repair Cars
摘要：You are given an integer array ranks representing the ranks of some mechanics. ranksi is the rank of the ith mechanic. A mechanic with a rank r can re 阅读全文
posted @ 2023-09-07 06:35 CNoodle 阅读(118) 评论(2) 推荐(0)
[LeetCode] 2433. Find The Original Array of Prefix Xor
摘要：You are given an integer array pref of size n. Find and return the array arr of size n that satisfies: pref[i] = arr[0] ^ arr[1] ^ ... ^ arr[i]. Note 阅读全文
posted @ 2023-09-05 04:13 CNoodle 阅读(93) 评论(0) 推荐(0)
[LeetCode] 2707. Extra Characters in a String
摘要：You are given a 0-indexed string s and a dictionary of words dictionary. You have to break s into one or more non-overlapping substrings such that eac 阅读全文
posted @ 2023-09-03 02:20 CNoodle 阅读(189) 评论(0) 推荐(0)
[LeetCode] 1921. Eliminate Maximum Number of Monsters
摘要：You are playing a video game where you are defending your city from a group of n monsters. You are given a 0-indexed integer array dist of size n, whe 阅读全文
posted @ 2023-09-03 00:59 CNoodle 阅读(107) 评论(0) 推荐(0)
[LeetCode] 1560. Most Visited Sector in a Circular Track
摘要：Given an integer n and an integer array rounds. We have a circular track which consists of n sectors labeled from 1 to n. A marathon will be held on t 阅读全文
posted @ 2023-09-02 06:36 CNoodle 阅读(41) 评论(0) 推荐(0)
[LeetCode] 2511. Maximum Enemy Forts That Can Be Captured
摘要：You are given a 0-indexed integer array forts of length n representing the positions of several forts. forts[i] can be -1, 0, or 1 where: -1 represent 阅读全文
posted @ 2023-09-02 01:12 CNoodle 阅读(43) 评论(0) 推荐(0)
[LeetCode] 2240. Number of Ways to Buy Pens and Pencils
摘要：You are given an integer total indicating the amount of money you have. You are also given two integers cost1 and cost2 indicating the price of a pen 阅读全文
posted @ 2023-09-01 04:35 CNoodle 阅读(47) 评论(0) 推荐(0)