码迷,mamicode.com
首页 >  
搜索关键字:could not find driver    ( 34312个结果
Combination Sum leetcode java
题目:Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same re....
分类:编程语言   时间:2014-08-01 10:43:21    阅读次数:266
Valid Sudoku leetcode java
题目:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled ....
分类:编程语言   时间:2014-08-01 10:31:31    阅读次数:261
Sum Root to Leaf Numbers leetcode java
题目:Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 w....
分类:编程语言   时间:2014-08-01 06:57:21    阅读次数:297
[leetcode]Longest Palindromic Substring
Longest Palindromic SubstringGiven a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there...
分类:其他好文   时间:2014-08-01 04:47:25    阅读次数:243
[leetcode]Single Number
Single NumberGiven an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runti...
分类:其他好文   时间:2014-08-01 04:44:31    阅读次数:189
LeetCode 第一题,Two Sum
题目还原 Two Sum Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up t...
分类:其他好文   时间:2014-08-01 02:25:11    阅读次数:391
Word Search leetcode java
题目:Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "ad....
分类:编程语言   时间:2014-08-01 02:20:41    阅读次数:236
[leetcode]Longest Substring Without Repeating Characters
Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters. For example, the ...
分类:其他好文   时间:2014-07-31 23:46:00    阅读次数:256
[leetcode]Longest Common Prefix
Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings.算法思路:思路:貌似木有什么捷径,逐个比较,遇到不同即断开。代码如下: 1 publi...
分类:其他好文   时间:2014-07-31 23:31:50    阅读次数:231
[leetcode]Maximum Depth of Binary Tree
Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root ...
分类:其他好文   时间:2014-07-31 23:19:10    阅读次数:259
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!