qdqade的博客_leetcode(2)

Sudoku Solver

Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku puzzle......

Sudoku Solver

原创 2015-09-14 08:49:32 462 阅读

Search in Rotated Sorted Array II

Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the

target

determine

function

affect

complexity

原创 2015-09-13 11:08:19 408 阅读

Search in Rotated Sorted Array

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

search

target

return

become

otherwise

原创 2015-09-13 10:26:16 259 阅读

Longest Valid Parentheses

Given a string containing just the characters '(' and ')' , find the length of the longest valid (well-formed) parentheses substring.For "(()" , t

动态

表达式

where

example

转载精选 2015-09-13 09:01:18 302 阅读

全排列总结

Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and [2,

example

numbers

possible

contain

转载精选 2015-09-12 18:01:33 416 阅读

Regular Expression Matching

'.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the

character

function

examples

matching

entire

原创 2015-09-11 09:49:04 346 阅读

青蛙跳台阶

一只青蛙一次可以跳上1级台阶，也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。关于本题，前提是n个台阶会有一次n阶的跳法。分析如下:f(1) = 1f(2) = f(2-1) + f(2-2) //f(2-2) 表示2阶一次跳2阶的次数。f(3) = f(3-1) + f(3-2) + f(3-3)

青蛙跳台阶

转载精选 2015-09-08 12:58:27 1424 阅读

leetcode find minimum in rotate sorted array

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).Find the minimum element.有可能有重复值解法：low，mid，high（1）我们用两个指针left,

元素

element

become

minimum

转载精选 2015-09-08 12:23:11 345 阅读

约瑟夫环问题

约瑟夫环问题的原来描述为，设有编号为1，2，……，n的n(n>0)个人围成一个圈，从第1个人开始报数，报到m时停止报数，报m的人出圈，再从他的下一个人起重新报数，报到m时停止报数，报m的出圈，……，如此下去，直到所有人全部出圈为止。当任意给定n和m后，设计算法求n个人出圈的次序。解法一：用 list 代替环，注意边界问题时间复杂度为O(m*n),n-1个数，每个数需m次 int L

约瑟夫环

原创 2015-09-07 19:03:56 699 阅读

leetecode 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 to the target, where i

two sum

原创 2015-09-07 11:06:47 342 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

searching

Sudoku Solver

Search in Rotated Sorted Array II

Search in Rotated Sorted Array

Longest Valid Parentheses

全排列总结

Regular Expression Matching

青蛙跳台阶

leetcode find minimum in rotate sorted array

约瑟夫环问题

leetecode two sum

欢迎