2019年5月7日

Global and Local Inversions LT775
摘要： We have some permutation A of [0, 1, ..., N - 1], where N is the length of A. The number of (global) inversions is the number of i < j with 0 <= i < j 阅读全文
posted @ 2019-05-07 22:13 一直走在路上 阅读(103) 评论(0) 推荐(0)
Number of Matching Subsequences LT729
摘要： Given string S and a dictionary of words words, find the number of words[i] that is a subsequence of S. Example : Input: S = "abcde" words = ["a", "bb 阅读全文
posted @ 2019-05-07 10:50 一直走在路上 阅读(151) 评论(0) 推荐(0)
Number of Subarrays with Bounded Maximum LT795
摘要： We are given an array A of positive integers, and two positive integers L and R (L <= R). Return the number of (contiguous, non-empty) subarrays such 阅读全文
posted @ 2019-05-07 07:12 一直走在路上 阅读(102) 评论(0) 推荐(0)

导航