04 2020 档案

[LeetCode] 942. DI String Match 增减DI字符串匹配

摘要：Given a string that only contains "I" (increase) or "D" (decrease), let . Return any permutation of such that for all : If , then Example 1: Example 2 阅读全文

posted @ 2020-04-30 04:33 Grandyang 阅读(1148) 评论(0) 推荐(0)

[LeetCode] 941. Valid Mountain Array 验证山形数组

摘要：Given an array of integers, return if and only if it is a valid mountain array . Recall that A is a mountain array if and only if: There exists some w 阅读全文

posted @ 2020-04-27 07:19 Grandyang 阅读(1534) 评论(0) 推荐(1)

[LeetCode] 940. Distinct Subsequences II 不同的子序列之二

摘要：Given a string , count the number of distinct, non empty subsequences of . Since the result may be large, return the answer modulo . Example 1: Exampl 阅读全文

posted @ 2020-04-20 06:23 Grandyang 阅读(4647) 评论(0) 推荐(0)

[LeetCode] 939. Minimum Area Rectangle 面积最小的矩形

摘要：Given a set of points in the xy plane, determine the minimum area of a rectangle formed from these points, with sides parallel to the x and y axes. If 阅读全文

posted @ 2020-04-13 06:26 Grandyang 阅读(3752) 评论(1) 推荐(0)

[LeetCode] 938. Range Sum of BST 二叉搜索树的区间和

摘要：Given the node of a binary search tree, return the sum of values of all nodes with value between and (inclusive). The binary search tree is guaranteed 阅读全文

posted @ 2020-04-06 07:41 Grandyang 阅读(3426) 评论(0) 推荐(0)