11 2015 档案

Sum of bit differences among all pairs
摘要：This article was found from Geeksforgeeks.org.Click here to see the original article.Given an integer array of n integers, find sum of bit differences... 阅读全文
posted @ 2015-11-14 05:41 fenshen371 阅读(365) 评论(0) 推荐(0)
Combination Sum III - LeetCode
摘要：Find all possible combinations ofknumbers that add up to a numbern, given that only numbers from 1 to 9 can be used and each combination should be a u... 阅读全文
posted @ 2015-11-10 14:40 fenshen371 阅读(145) 评论(0) 推荐(0)
Combination Sum II - LeetCode
摘要：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ... 阅读全文
posted @ 2015-11-10 14:28 fenshen371 阅读(158) 评论(0) 推荐(0)
Subsets - LeetCode
摘要：Given a set of distinct integers,nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not... 阅读全文
posted @ 2015-11-10 14:16 fenshen371 阅读(183) 评论(0) 推荐(0)
Combination Sum - LeetCode
摘要：Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文
posted @ 2015-11-10 14:11 fenshen371 阅读(151) 评论(0) 推荐(0)
Unique Binary Search Trees II - LeetCode
摘要：Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文
posted @ 2015-11-10 02:34 fenshen371 阅读(153) 评论(0) 推荐(0)
Find Median from Data Stream - LeetCode
摘要：Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two... 阅读全文
posted @ 2015-11-09 11:10 fenshen371 阅读(213) 评论(0) 推荐(0)
Kth Largest Element in an Array - LeetCode
摘要：Find thekth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For exampl... 阅读全文
posted @ 2015-11-09 10:43 fenshen371 阅读(144) 评论(0) 推荐(0)
Add and Search Word - Data structure design - LeetCode
摘要：Design a data structure that supports the following two operations:void addWord(word)bool search(word)search(word) can search a literal word or a regu... 阅读全文
posted @ 2015-11-09 08:04 fenshen371 阅读(167) 评论(0) 推荐(0)
Implement Trie (Prefix Tree) - LeetCode
摘要：Implement a trie withinsert,search, andstartsWithmethods.Note:You may assume that all inputs are consist of lowercase lettersa-z.思路：应该就是字典树。 1 class T... 阅读全文
posted @ 2015-11-09 07:39 fenshen371 阅读(146) 评论(0) 推荐(0)
Edit Distance - LeetCode
摘要：Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol... 阅读全文
posted @ 2015-11-08 12:56 fenshen371 阅读(158) 评论(0) 推荐(0)
Wildcard Matching - LeetCode
摘要：Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the e... 阅读全文
posted @ 2015-11-04 15:37 fenshen371 阅读(137) 评论(0) 推荐(0)
Longest Increasing Subsequence - LeetCode
摘要：Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given[10, 9, 2, 5, 3, 7, 101, 18],The longest incre... 阅读全文
posted @ 2015-11-04 12:57 fenshen371 阅读(176) 评论(0) 推荐(0)
Unique Paths II - LeetCode
摘要：Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i... 阅读全文
posted @ 2015-11-04 11:15 fenshen371 阅读(175) 评论(0) 推荐(0)
Decode Ways - LeetCode
摘要：A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message conta... 阅读全文
posted @ 2015-11-04 10:54 fenshen371 阅读(121) 评论(0) 推荐(0)
Maximum Product Subarray - LeetCode
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the... 阅读全文
posted @ 2015-11-04 09:47 fenshen371 阅读(162) 评论(0) 推荐(0)