随笔分类 -  LeetCode

上一页 1 ··· 50 51 52 53 54 55 56 57 58 ··· 61 下一页
摘要:Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules: Each of the digits 1-9 阅读全文
posted @ 2015-04-13 12:22 Grandyang 阅读(20757) 评论(5) 推荐(2) 编辑
摘要:Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: Each row must contain the dig 阅读全文
posted @ 2015-04-13 07:05 Grandyang 阅读(21910) 评论(4) 推荐(3) 编辑
摘要:Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numb 阅读全文
posted @ 2015-04-12 13:19 Grandyang 阅读(20617) 评论(0) 推荐(1) 编辑
摘要:Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen nu 阅读全文
posted @ 2015-04-12 12:03 Grandyang 阅读(37856) 评论(18) 推荐(5) 编辑
摘要:Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found 阅读全文
posted @ 2015-04-09 13:01 Grandyang 阅读(21684) 评论(11) 推荐(3) 编辑
摘要:Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if i 阅读全文
posted @ 2015-04-09 08:31 Grandyang 阅读(14852) 评论(4) 推荐(1) 编辑
摘要:Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen 阅读全文
posted @ 2015-04-08 15:56 Grandyang 阅读(39147) 评论(5) 推荐(3) 编辑
摘要:Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Exampl 阅读全文
posted @ 2015-04-08 14:46 Grandyang 阅读(43243) 评论(8) 推荐(0) 编辑
摘要:Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*' where: '?' Matches any single character. 阅读全文
posted @ 2015-04-08 01:39 Grandyang 阅读(30600) 评论(22) 推荐(2) 编辑
摘要:Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses O( 阅读全文
posted @ 2015-04-06 14:59 Grandyang 阅读(29399) 评论(19) 推荐(3) 编辑
摘要:Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Note: You mus 阅读全文
posted @ 2015-04-06 06:53 Grandyang 阅读(26624) 评论(10) 推荐(4) 编辑
摘要:Given a binary tree, imagine yourself standing on therightside of it, return the values of the nodes you can see ordered from top to bottom.For exampl... 阅读全文
posted @ 2015-04-04 15:06 Grandyang 阅读(13682) 评论(2) 推荐(1) 编辑
摘要:You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in-place, which means 阅读全文
posted @ 2015-04-03 11:33 Grandyang 阅读(32836) 评论(7) 推荐(2) 编辑
摘要:Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearrang 阅读全文
posted @ 2015-04-02 06:14 Grandyang 阅读(24201) 评论(11) 推荐(1) 编辑
摘要:Implement pow(x, n), which calculates x raised to the power n (i.e., x^n). Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000 Example 2: Input: 阅读全文
posted @ 2015-04-01 14:34 Grandyang 阅读(36994) 评论(19) 推荐(1) 编辑
摘要:You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
posted @ 2015-04-01 13:41 Grandyang 阅读(42847) 评论(12) 推荐(2) 编辑
摘要:The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return th 阅读全文
posted @ 2015-03-31 13:54 Grandyang 阅读(10010) 评论(2) 推荐(0) 编辑
摘要:The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return al 阅读全文
posted @ 2015-03-30 13:18 Grandyang 阅读(23309) 评论(3) 推荐(0) 编辑
摘要:Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Ex 阅读全文
posted @ 2015-03-30 09:20 Grandyang 阅读(43002) 评论(11) 推荐(1) 编辑
摘要:You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum len 阅读全文
posted @ 2015-03-28 03:31 Grandyang 阅读(31195) 评论(4) 推荐(2) 编辑

上一页 1 ··· 50 51 52 53 54 55 56 57 58 ··· 61 下一页
Fork me on GitHub