上一页 1 ··· 9 10 11 12 13 14 15 16 17 ··· 37 下一页
摘要: Consider a multiset of integers S, the union of n closed intervals of positive integers: S = [l1..r1] ∪ [l2..r2] ∪ · · · ∪ [ln..rn](recall that a clos 阅读全文
posted @ 2019-10-25 05:55 Review->Improve 阅读(224) 评论(0) 推荐(0) 编辑
摘要: Smaller input size: https://codeforces.com/contest/1249/problem/D1 Big input size: https://codeforces.com/contest/1249/problem/D2 Given n segments on 阅读全文
posted @ 2019-10-25 04:56 Review->Improve 阅读(540) 评论(0) 推荐(0) 编辑
摘要: You are given a string consisting of the letters x and y, such as xyxxxyxyy. In addition, you have an operation called flip, which changes a single x  阅读全文
posted @ 2019-10-25 00:48 Review->Improve 阅读(1251) 评论(0) 推荐(0) 编辑
摘要: You are given a string containing only 4 kinds of characters 'Q', 'W', 'E' and 'R'. A string is said to be balanced if each of its characters appears  阅读全文
posted @ 2019-10-21 22:30 Review->Improve 阅读(1226) 评论(0) 推荐(0) 编辑
摘要: Given n kinds of present and m boxes. Find out the different ways to pack all boxes with presents, using the following rules. 1. Each box can not have 阅读全文
posted @ 2019-10-18 11:25 Review->Improve 阅读(149) 评论(0) 推荐(0) 编辑
摘要: Given an array nums of positive integers, return the longest possible length of an array prefix of nums, such that it is possible to remove exactly on 阅读全文
posted @ 2019-10-14 03:10 Review->Improve 阅读(722) 评论(0) 推荐(0) 编辑
摘要: A die simulator generates a random number from 1 to 6 for each roll. You introduced a constraint to the generator such that it cannot roll the number  阅读全文
posted @ 2019-10-14 01:42 Review->Improve 阅读(1399) 评论(0) 推荐(0) 编辑
摘要: Your music player contains N different songs and she wants to listen to L (not necessarily different) songs during your trip. You create a playlist so 阅读全文
posted @ 2019-10-11 11:09 Review->Improve 阅读(326) 评论(0) 推荐(0) 编辑
摘要: Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences. After doing so, 阅读全文
posted @ 2019-09-29 07:04 Review->Improve 阅读(865) 评论(0) 推荐(0) 编辑
摘要: Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Input:nums = 阅读全文
posted @ 2019-09-29 06:26 Review->Improve 阅读(414) 评论(0) 推荐(0) 编辑
上一页 1 ··· 9 10 11 12 13 14 15 16 17 ··· 37 下一页