上一页 1 ··· 10 11 12 13 14 15 16 17 18 ··· 40 下一页
摘要: Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes 阅读全文
posted @ 2016-09-20 05:59 amazingzoe 阅读(232) 评论(0) 推荐(0)
摘要: Description: Count the number of prime numbers less than a non-negative number, n. Analyse: start from 2, label 2 * 2, 2 * 3... as false; then move to 阅读全文
posted @ 2016-09-20 04:23 amazingzoe 阅读(132) 评论(0) 推荐(0)
摘要: Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Note: Given target value is a floati 阅读全文
posted @ 2016-09-20 00:50 amazingzoe 阅读(124) 评论(0) 推荐(0)
摘要: Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文
posted @ 2016-09-19 05:18 amazingzoe 阅读(109) 评论(0) 推荐(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 sp 阅读全文
posted @ 2016-09-19 05:06 amazingzoe 阅读(128) 评论(0) 推荐(0)
摘要: Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the or 阅读全文
posted @ 2016-09-19 02:19 amazingzoe 阅读(128) 评论(0) 推荐(0)
摘要: Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function 阅读全文
posted @ 2016-09-19 01:22 amazingzoe 阅读(123) 评论(0) 推荐(0)
摘要: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2016-09-19 01:15 amazingzoe 阅读(146) 评论(0) 推荐(0)
摘要: Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, 阅读全文
posted @ 2016-09-19 00:35 amazingzoe 阅读(121) 评论(0) 推荐(0)
摘要: Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the condition nums[i] + 阅读全文
posted @ 2016-09-17 23:23 amazingzoe 阅读(160) 评论(0) 推荐(0)
上一页 1 ··· 10 11 12 13 14 15 16 17 18 ··· 40 下一页