08 2023 档案

[LeetCode] 2483. Minimum Penalty for a Shop
摘要：You are given the customer visit log of a shop represented by a 0-indexed string customers consisting only of characters 'N' and 'Y': if the ith chara 阅读全文
posted @ 2023-08-30 02:35 CNoodle 阅读(80) 评论(0) 推荐(0)
[LeetCode] 1267. Count Servers that Communicate
摘要：You are given a map of a server center, represented as a m * n integer matrix grid, where 1 means that on that cell there is a server and 0 means that 阅读全文
posted @ 2023-08-24 01:22 CNoodle 阅读(46) 评论(0) 推荐(0)
[LeetCode] 2337. Move Pieces to Obtain a String
摘要：You are given two strings start and target, both of length n. Each string consists only of the characters 'L', 'R', and '_' where: The characters 'L' 阅读全文
posted @ 2023-08-22 02:15 CNoodle 阅读(89) 评论(0) 推荐(0)
[LeetCode] 2682. Find the Losers of the Circular Game
摘要：There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More formally, movin 阅读全文
posted @ 2023-08-16 02:45 CNoodle 阅读(59) 评论(0) 推荐(0)
[LeetCode] 2369. Check if There is a Valid Partition For The Array
摘要：You are given a 0-indexed integer array nums. You have to partition the array into one or more contiguous subarrays. We call a partition of the array  阅读全文
posted @ 2023-08-14 13:07 CNoodle 阅读(77) 评论(0) 推荐(0)
[LeetCode] 980. Unique Paths III
摘要：You are given an m x n integer array grid where grid[i][j] could be: 1 representing the starting square. There is exactly one starting square. 2 repre 阅读全文
posted @ 2023-08-04 00:49 CNoodle 阅读(68) 评论(0) 推荐(0)
[LeetCode] 712. Minimum ASCII Delete Sum for Two Strings
摘要：Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Input: s1 = "sea", s2 = "eat" Out 阅读全文
posted @ 2023-08-01 04:38 CNoodle 阅读(54) 评论(0) 推荐(0)