Given an array with n integers, you need to find if there are triplets i, j, k which satisfies following conditions: lt i, i lt j, j lt k lt n Sum of subarrays , i , i , j , j , k and k , n should be ...
2017-05-14 23:43 7 6687 推荐指数：
In a given integer array A, we must move every element of A to either list B or list C. (B and C initially start empty.) Return true if and only ...
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write ...
Given a string S of digits, such as S = "123456579", we can split it into a Fibonacci-like sequence [123, 456, 579]. Formally, a Fibonacci-like ...
You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each ...
Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements ...
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum ...
659. 分割数组为连续子序列 输入一个按升序排序的整数数组（可能包含重复数字），你需要将它们分割成几个子序列，其中每个子序列至少包含三个连续整数。返回你是否能做出这样的分割？ 示例 1： 示例 2： 示例 3： 提示： 输入的数组 ...
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 ...
