2017年11月8日
Leetcode 43: Multiply Strings
摘要： Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2. Note: The length of both num1 and num2 is < 阅读全文
posted @ 2017-11-08 11:50 逸朵 阅读(105) 评论(0) 推荐(0)
Leetcode 42: Trapping Rain Water
摘要： Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. 阅读全文
posted @ 2017-11-08 10:26 逸朵 阅读(92) 评论(0) 推荐(0)
2017年11月7日
Leetcode 40: Combination Sum II
摘要： Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each num 阅读全文
posted @ 2017-11-07 12:44 逸朵 阅读(124) 评论(0) 推荐(0)
Leetcode 39: Combination Sum
摘要： Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums 阅读全文
posted @ 2017-11-07 12:25 逸朵 阅读(365) 评论(0) 推荐(0)
Leetcode 38: Count and Say
摘要： The count-and-say sequence is the sequence of integers with the first five terms as following: 1 is read off as "one 1" or 11.11 is read off as "two 1 阅读全文
posted @ 2017-11-07 11:36 逸朵 阅读(155) 评论(0) 推荐(0)
2017年11月6日
Leetcode 37: Sudoku Solver
摘要： ve 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 solut 阅读全文
posted @ 2017-11-06 07:53 逸朵 阅读(131) 评论(0) 推荐(0)
Leetcode 36: Valid Sudoku
摘要： Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled wit 阅读全文
posted @ 2017-11-06 05:45 逸朵 阅读(133) 评论(0) 推荐(0)
Leetcode 35: Search Insert Position
摘要： 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 @ 2017-11-06 04:48 逸朵 阅读(133) 评论(0) 推荐(0)
Leetcode 34: Search for a Range
摘要： Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexi 阅读全文
posted @ 2017-11-06 02:55 逸朵 阅读(113) 评论(0) 推荐(0)
Leetcode 33: Search in Rotated Sorted Array
摘要： Suppose an array sorted in ascending order 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 a 阅读全文
posted @ 2017-11-06 02:15 逸朵 阅读(133) 评论(0) 推荐(0)