09 2021 档案

[LeetCode] 1909. Remove One Element to Make the Array Strictly Increasing
摘要：Given a 0-indexed integer array nums, return true if it can be made strictly increasing after removing exactly one element, or false otherwise. If the 阅读全文
posted @ 2021-09-22 07:16 CNoodle 阅读(538) 评论(0) 推荐(0)
[LeetCode] 1475. Final Prices With a Special Discount in a Shop
摘要：Given the array prices where prices[i] is the price of the ith item in a shop. There is a special discount for items in the shop, if you buy the ith i 阅读全文
posted @ 2021-09-22 00:40 CNoodle 阅读(295) 评论(0) 推荐(0)
[LeetCode] 650. 2 Keys Keyboard
摘要：There is only one character 'A' on the screen of a notepad. You can perform two operations on this notepad for each step: Copy All: You can copy all t 阅读全文
posted @ 2021-09-21 14:36 CNoodle 阅读(73) 评论(0) 推荐(0)
[LeetCode] 1382. Balance a Binary Search Tree
摘要：Given the root of a binary search tree, return a balanced binary search tree with the same node values. If there is more than one answer, return any o 阅读全文
posted @ 2021-09-17 00:24 CNoodle 阅读(563) 评论(0) 推荐(0)
[LeetCode] 917. Reverse Only Letters
摘要：Given a string s, reverse the string according to the following rules: All the characters that are not English letters remain in the same position. Al 阅读全文
posted @ 2021-09-16 23:45 CNoodle 阅读(107) 评论(0) 推荐(0)
[LeetCode] 1189. Maximum Number of Balloons
摘要：Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible. You can use each character in 阅读全文
posted @ 2021-09-15 01:07 CNoodle 阅读(94) 评论(0) 推荐(0)
[LeetCode] 447. Number of Boomerangs
摘要：You are given n points in the plane that are all distinct, where points[i] = [xi, yi]. A boomerang is a tuple of points (i, j, k) such that the distan 阅读全文
posted @ 2021-09-14 00:01 CNoodle 阅读(239) 评论(0) 推荐(0)
[LeetCode] 1894. Find the Student that Will Replace the Chalk
摘要：There are n students in a class numbered from 0 to n - 1. The teacher will give each student a problem starting with the student number 0, then the st 阅读全文
posted @ 2021-09-11 00:30 CNoodle 阅读(243) 评论(0) 推荐(0)
[LeetCode] 1037. Valid Boomerang
摘要：Given an array points where points[i] = [xi, yi] represents a point on the X-Y plane, return true if these points are a boomerang. A boomerang is a se 阅读全文
posted @ 2021-09-10 23:28 CNoodle 阅读(48) 评论(0) 推荐(0)
[LeetCode] 1973. Count Nodes Equal to Sum of Descendants
摘要：Given the root of a binary tree, return the number of nodes where the value of the node is equal to the sum of the values of its descendants. A descen 阅读全文
posted @ 2021-09-10 00:20 CNoodle 阅读(171) 评论(0) 推荐(0)
[LeetCode] 1629. Slowest Key
摘要：A newly designed keypad was tested, where a tester pressed a sequence of n keys, one at a time. You are given a string keysPressed of length n, where  阅读全文
posted @ 2021-09-09 01:32 CNoodle 阅读(151) 评论(0) 推荐(0)
[LeetCode] 1202. Smallest String With Swaps
摘要：You are given a string s, and an array of pairs of indices in the string pairs where pairs[i] = [a, b] indicates 2 indices(0-indexed) of the string. Y 阅读全文
posted @ 2021-09-06 14:53 CNoodle 阅读(120) 评论(0) 推荐(0)
[LeetCode] 470. Implement Rand10() Using Rand7()
摘要：Given the API rand7() that generates a uniform random integer in the range [1, 7], write a function rand10() that generates a uniform random integer i 阅读全文
posted @ 2021-09-06 04:37 CNoodle 阅读(156) 评论(0) 推荐(0)