08 2021 档案

[LeetCode] 1984. Minimum Difference Between Highest and Lowest of K Scores
摘要：You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer k. Pick the scores 阅读全文
posted @ 2021-08-30 23:55 CNoodle 阅读(267) 评论(0) 推荐(0)
[LeetCode] 1588. Sum of All Odd Length Subarrays
摘要：Given an array of positive integers arr, calculate the sum of all possible odd-length subarrays. A subarray is a contiguous subsequence of the array. 阅读全文
posted @ 2021-08-30 16:15 CNoodle 阅读(371) 评论(0) 推荐(0)
[LeetCode] 653. Two Sum IV - Input is a BST
摘要：Given the root of a Binary Search Tree and a target number k, return true if there exist two elements in the BST such that their sum is equal to the g 阅读全文
posted @ 2021-08-24 23:28 CNoodle 阅读(222) 评论(0) 推荐(0)
[LeetCode] 1980. Find Unique Binary String
摘要：Given an array of strings nums containing n unique binary strings each of length n, return a binary string of length n that does not appear in nums. I 阅读全文
posted @ 2021-08-23 23:37 CNoodle 阅读(376) 评论(0) 推荐(0)
[LeetCode] 1339. Maximum Product of Splitted Binary Tree
摘要：Given the root of a binary tree, split the binary tree into two subtrees by removing one edge such that the product of the sums of the subtrees is max 阅读全文
posted @ 2021-08-20 11:01 CNoodle 阅读(283) 评论(0) 推荐(0)
[LeetCode] 1509. Minimum Difference Between Largest and Smallest Value in Three Moves
摘要：Given an array nums, you are allowed to choose one element of nums and change it by any value in one move. Return the minimum difference between the l 阅读全文
posted @ 2021-08-20 00:59 CNoodle 阅读(475) 评论(0) 推荐(0)
[LeetCode] 233. Number of Digit One
摘要：Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. Example 1: Input: n = 13 Output: 阅读全文
posted @ 2021-08-19 23:16 CNoodle 阅读(83) 评论(0) 推荐(0)
[LeetCode] 1963. Minimum Number of Swaps to Make the String Balanced
摘要：You are given a 0-indexed string s of even length n. The string consists of exactly n / 2 opening brackets '[' and n / 2 closing brackets ']'. A strin 阅读全文
posted @ 2021-08-18 23:41 CNoodle 阅读(472) 评论(0) 推荐(0)
[LeetCode] 1053. Previous Permutation With One Swap
摘要：Given an array of positive integers arr (not necessarily distinct), return the lexicographically largest permutation that is smaller than arr, that ca 阅读全文
posted @ 2021-08-16 22:55 CNoodle 阅读(85) 评论(0) 推荐(0)
[LeetCode] 1962. Remove Stones to Minimize the Total
摘要：You are given a 0-indexed integer array piles, where piles[i] represents the number of stones in the ith pile, and an integer k. You should apply the 阅读全文
posted @ 2021-08-16 02:44 CNoodle 阅读(357) 评论(0) 推荐(0)
[LeetCode] 1961. Check If String Is a Prefix of Array
摘要：Given a string s and an array of strings words, determine whether s is a prefix string of words. A string s is a prefix string of words if s can be ma 阅读全文
posted @ 2021-08-15 06:23 CNoodle 阅读(182) 评论(0) 推荐(0)
[LeetCode] 313. Super Ugly Number
摘要：A super ugly number is a positive integer whose prime factors are in the array primes. Given an integer n and an array of integers primes, return the  阅读全文
posted @ 2021-08-09 23:37 CNoodle 阅读(297) 评论(0) 推荐(0)
[LeetCode] 457. Circular Array Loop
摘要：You are playing a game involving a circular array of non-zero integers nums. Each nums[i] denotes the number of indices forward/backward you must move 阅读全文
posted @ 2021-08-08 15:18 CNoodle 阅读(143) 评论(0) 推荐(0)
[LeetCode] 1137. N-th Tribonacci Number
摘要：The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn. Exa 阅读全文
posted @ 2021-08-08 12:57 CNoodle 阅读(156) 评论(0) 推荐(0)
[LeetCode] 802. Find Eventual Safe States
摘要：We start at some node in a directed graph, and every turn, we walk along a directed edge of the graph. If we reach a terminal node (that is, it has no 阅读全文
posted @ 2021-08-05 12:27 CNoodle 阅读(138) 评论(0) 推荐(0)
[LeetCode] 356. Line Reflection
摘要：Given n points on a 2D plane, find if there is such a line parallel to y-axis that reflect the given points symmetrically, in other words, answer whet 阅读全文
posted @ 2021-08-04 23:11 CNoodle 阅读(150) 评论(0) 推荐(0)
[LeetCode] 1946. Largest Number After Mutating Substring
摘要：You are given a string num, which represents a large integer. You are also given a 0-indexed integer array change of length 10 that maps each digit 0- 阅读全文
posted @ 2021-08-02 13:17 CNoodle 阅读(140) 评论(0) 推荐(0)