原创 leetcode(187):Repeated DNA Sequences

原題: All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: “ACGAATTCCG”. When

原创 leetcode(318):Maximum Product of Word Lengths

原題: Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do

原创 leetcode:Combination Sum(I,II)

原題: Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the cand

原创 leetcode(368):Largest Divisible Subset

原題: Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements i

原创 leetcode(78):Subsets

原題: Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain d

原创 leetcode():Permutations

Permutations : Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] hav

原创 leetcode(282): Expression Add Operators

Given a string that contains only digits 0-9 and a target value,return all possibilities to add binary operators (n

原创 leetcode(90):Subsets II

原題: Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: The sol

原创 leetcode(45):Jump Game II

原題: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each el

原创 leetcode(17):Letter Combinations of a Phone Number

原題: Given a digit string, return all possible letter combinations that the number could represent. A mapping of di

原创 leetcode(274):H-Index

原題: Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to com

原创 leetcode(150):Evaluate Reverse Polish Notation

原題: Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Eac

原创 leetcode(375):Guess Number Higher or Lower II

原題: We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which nu

原创 leetcode:First Missing Positive

原題: Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3,

原创 leetcode[208]:Implement Trie (Prefix Tree)

【題目】 Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are cons