Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ... Read More
posted @ 2014-07-29 11:31
Xylophone
Views(150)
Comments(0)
Diggs(0)
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example,... Read More
posted @ 2014-07-28 15:00
Xylophone
Views(147)
Comments(0)
Diggs(0)
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... Read More
posted @ 2014-07-26 22:19
Xylophone
Views(122)
Comments(0)
Diggs(0)
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example, Given the following matrix:[ [ 1,... Read More
posted @ 2014-07-26 21:15
Xylophone
Views(153)
Comments(0)
Diggs(0)
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example, Given n = 3,You should return the followin... Read More
posted @ 2014-07-26 21:01
Xylophone
Views(134)
Comments(0)
Diggs(0)
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space... Read More
posted @ 2014-07-26 11:11
Xylophone
Views(152)
Comments(0)
Diggs(0)
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example: Given binary tree {3... Read More
posted @ 2014-07-26 10:38
Xylophone
Views(133)
Comments(0)
Diggs(0)
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F... Read More
posted @ 2014-07-26 08:25
Xylophone
Views(125)
Comments(0)
Diggs(0)
Given a collection of numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,... Read More
posted @ 2014-07-25 22:33
Xylophone
Views(135)
Comments(0)
Diggs(0)
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.N... Read More
posted @ 2014-07-25 22:03
Xylophone
Views(191)
Comments(0)
Diggs(0)
浙公网安备 33010602011771号