Fork me on GitHub
摘要: Given a collection of integers that might contain duplicates, nums, return all possible subsets.Note: The solution set must not contain duplicate subs 阅读全文
posted @ 2017-06-03 23:35 hellowOOOrld 阅读(157) 评论(0) 推荐(0)
摘要: Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1 阅读全文
posted @ 2017-06-03 21:36 hellowOOOrld 阅读(340) 评论(0) 推荐(0)
摘要: Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.Strings consists of lowercase English letters only and the 阅读全文
posted @ 2017-06-03 12:30 hellowOOOrld 阅读(145) 评论(0) 推荐(0)
摘要: Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = 阅读全文
posted @ 2017-06-03 11:01 hellowOOOrld 阅读(133) 评论(0) 推荐(0)
摘要: Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["na 阅读全文
posted @ 2017-06-03 10:35 hellowOOOrld 阅读(140) 评论(0) 推荐(0)