上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 31 下一页
摘要: 题目: Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non 阅读全文
posted @ 2017-04-16 03:02 panini 阅读(163) 评论(0) 推荐(0) 编辑
摘要: 题目: 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 阅读全文
posted @ 2017-04-15 10:38 panini 阅读(134) 评论(0) 推荐(0) 编辑
摘要: 题目: Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers s 阅读全文
posted @ 2017-04-15 10:15 panini 阅读(362) 评论(0) 推荐(0) 编辑
摘要: 题目: Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled 阅读全文
posted @ 2017-04-15 08:01 panini 阅读(142) 评论(0) 推荐(0) 编辑
摘要: 题目: Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime comp 阅读全文
posted @ 2017-04-15 05:44 panini 阅读(165) 评论(0) 推荐(0) 编辑
摘要: 题目: 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). Y 阅读全文
posted @ 2017-04-15 03:55 panini 阅读(111) 评论(0) 推荐(0) 编辑
摘要: 题目: Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not po 阅读全文
posted @ 2017-04-15 00:47 panini 阅读(216) 评论(0) 推荐(0) 编辑
摘要: 题目: Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 链接:https://leetcode.com/problems/d 阅读全文
posted @ 2017-04-14 01:51 panini 阅读(221) 评论(0) 推荐(0) 编辑
摘要: 题目: Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Yo 阅读全文
posted @ 2017-04-13 01:33 panini 阅读(137) 评论(0) 推荐(0) 编辑
摘要: 题目: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set i 阅读全文
posted @ 2017-04-12 23:46 panini 阅读(174) 评论(0) 推荐(0) 编辑
上一页 1 ··· 11 12 13 14 15 16 17 18 19 ··· 31 下一页