码迷,mamicode.com
首页 >  
搜索关键字:leetcode 19    ( 34993个结果
leetcode -day19 Convert Sorted List to Binary Search Tree
1、 ?? Convert Sorted List to Binary Search Tree  Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 分析:将一个升序排列的链表转换为平衡二叉搜索树,采用递归的方式,先找到链表...
分类:其他好文   时间:2014-05-22 12:33:30    阅读次数:270
LeetCode: Search in Rotated Sorted Array [032]
【题目】 Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found in the array return its index, otherwise return -1. You may assume no du...
分类:其他好文   时间:2014-05-22 10:43:12    阅读次数:310
LeetCode: Valid Sudoku [035]
【题目】 Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled with the character '.'. A partially filled sudoku which is valid. Note: A valid Sudoku board (par...
分类:其他好文   时间:2014-05-22 09:58:54    阅读次数:234
LeetCode: Search Insert Position [034]
【题目】 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 order. You may assume no duplicates in the array. Here are few examples. [1,3,5,6], 5 → 2 [1,3,5,6]...
分类:其他好文   时间:2014-05-22 09:41:59    阅读次数:195
leetcode Longest Common Prefix
找出单词的最长公共前缀 class Solution { public: string longestCommonPrefix(vector &strs) { int len=strs.size(); if(len==0) return ""; int length=strs[0].size(),j; ...
分类:其他好文   时间:2014-05-22 09:35:20    阅读次数:230
[LeetCode]Letter Combinations of a Phone Number
Letter Combinations of a Phone Number DFS BFS...
分类:其他好文   时间:2014-05-22 09:23:16    阅读次数:267
【LeetCode】LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the value (will always be positive) of the key if t...
分类:其他好文   时间:2014-05-22 07:25:32    阅读次数:254
LeetCode: Search for a Range [033]
【题目】 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 order of O(log n). If the target is not found in the array, return [-1, -1]. For example, Given [5...
分类:其他好文   时间:2014-05-22 06:44:39    阅读次数:265
leetCode解题报告5道题(十)
5道题目分别是:【Largest Rectangle in Histogram】、【Minimum Path Sum】、【Jump Game】、【Jump Game II 】、【Valid Number】,由于有一些题目不需要发一整篇博文来记录,所以就将这些题目以一篇博文5道来记录。...
分类:其他好文   时间:2014-05-21 03:05:33    阅读次数:481
LeetCode: Longest Valid Parentheses [031]
【题目】 Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the longest valid parentheses substring is "()", which has length = 2. Another example is ")()())", whe...
分类:其他好文   时间:2014-05-20 16:39:07    阅读次数:280
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!