IncredibleThings

LeetCode - Increasing Order Search Tree

摘要： Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every no 阅读全文

posted @ 2021-02-25 16:26 IncredibleThings 阅读(54) 评论(0) 推荐(0)

LeetCode - Range Sum of BST

摘要： Given the root node of a binary search tree, return the sum of values of all nodes with a value in the range [low, high]. Example 1: Input: root = [10 阅读全文

posted @ 2021-02-25 16:02 IncredibleThings 阅读(39) 评论(0) 推荐(0)

LeetCode - Distribute Coins in Binary Tree

摘要： You are given the root of a binary tree with n nodes where each node in the tree has node.val coins and there are n coins total. In one move, we may c 阅读全文

posted @ 2021-02-24 16:07 IncredibleThings 阅读(33) 评论(0) 推荐(0)

LeetCode - Perfect Rectangle

摘要： Given N axis-aligned rectangles where N > 0, determine if they all together form an exact cover of a rectangular region. Each rectangle is represented 阅读全文

posted @ 2021-02-23 16:27 IncredibleThings 阅读(71) 评论(0) 推荐(0)

LeetCode - Count Sorted Vowel Strings

摘要： Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted. A string s 阅读全文

posted @ 2021-02-23 13:30 IncredibleThings 阅读(48) 评论(0) 推荐(0)

LeetCode - Minimum Add to Make Parentheses Valid

摘要： Given a string S of '(' and ')' parentheses, we add the minimum number of parentheses ( '(' or ')', and in any positions ) so that the resulting paren 阅读全文

posted @ 2021-02-22 15:35 IncredibleThings 阅读(40) 评论(0) 推荐(0)

LeetCode - Make The String Great

摘要： Given a string s of lower and upper case English letters. A good string is a string which doesn't have two adjacent characters s[i] and s[i + 1] where 阅读全文

posted @ 2021-02-21 14:45 IncredibleThings 阅读(47) 评论(0) 推荐(0)

LeetCode - Random Pick with Weight

摘要： You are given an array of positive integers w where w[i] describes the weight of ith index (0-indexed). We need to call the function pickIndex() which 阅读全文

posted @ 2021-02-21 13:30 IncredibleThings 阅读(63) 评论(0) 推荐(0)

LeetCode - Number of Good Pairs

摘要： Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Input: nums 阅读全文

posted @ 2021-02-20 16:04 IncredibleThings 阅读(58) 评论(0) 推荐(0)

LeetCode - Jewels and Stones

摘要： You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is 阅读全文

posted @ 2021-02-20 15:42 IncredibleThings 阅读(48) 评论(0) 推荐(0)

导航

公告