上一页 1 ··· 4 5 6 7 8 9 10 11 12 13 下一页
摘要: 题目描述: Given a collection of distinct numbers, return all possible permutations. For example,[1,2,3] have the following permutations: 题目要我们找到数组(无重复元素)的 阅读全文
posted @ 2018-03-01 22:51 宵夜在哪 阅读(83) 评论(0) 推荐(0) 编辑
摘要: 题目描述: Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2. Note: 题目要我们计算两个数(string形式,非负,只含数字,长度小 阅读全文
posted @ 2018-03-01 22:17 宵夜在哪 阅读(82) 评论(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. Ea 阅读全文
posted @ 2018-03-01 00:21 宵夜在哪 阅读(100) 评论(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 阅读全文
posted @ 2018-02-28 23:57 宵夜在哪 阅读(93) 评论(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 fill 阅读全文
posted @ 2018-02-28 00:26 宵夜在哪 阅读(105) 评论(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 co 阅读全文
posted @ 2018-02-27 23:16 宵夜在哪 阅读(97) 评论(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). 阅读全文
posted @ 2018-02-27 00:53 宵夜在哪 阅读(83) 评论(0) 推荐(0) 编辑
摘要: 题目描述: Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not 阅读全文
posted @ 2018-02-27 00:37 宵夜在哪 阅读(97) 评论(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. 阅读全文
posted @ 2018-02-26 00:17 宵夜在哪 阅读(88) 评论(0) 推荐(0) 编辑
摘要: 题目描述: Given a linked list, remove the nth node from the end of list and return its head. For example, Note: Given n will always be valid. Try to do th 阅读全文
posted @ 2018-02-25 23:05 宵夜在哪 阅读(85) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 12 13 下一页