2019年4月11日
918. Maximum Sum Circular Subarray
摘要： Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C. Here, a circular array means the en 阅读全文
posted @ 2019-04-11 22:33 Veritas_des_Liberty 阅读(271) 评论(0) 推荐(0)
914. X of a Kind in a Deck of Cards
摘要： In a deck of cards, each card has an integer written on it. Return true if and only if you can choose X >= 2 such that it is possible to split the ent 阅读全文
posted @ 2019-04-11 21:29 Veritas_des_Liberty 阅读(350) 评论(0) 推荐(0)
907. Sum of Subarray Minimums
摘要： Given an array of integers A, find the sum of min(B), where B ranges over every (contiguous) subarray of A. Since the answer may be large, return the 阅读全文
posted @ 2019-04-11 18:11 Veritas_des_Liberty 阅读(378) 评论(0) 推荐(0)