摘要:
Given an arraynumsand a target valuek, find the maximum length of a subarray that sums tok. If there isn't one, return 0 instead.Example 1:Givennums=[... 阅读全文
posted @ 2016-01-24 03:08
fenshen371
阅读(210)
评论(0)
推荐(0)
摘要:
Given a collection of integers that might contain duplicates,nums, return all possible subsets.Note:Elements in a subset must be in non-descending ord... 阅读全文
posted @ 2016-01-24 02:24
fenshen371
阅读(123)
评论(0)
推荐(0)