该文被密码保护。 阅读全文
posted @ 2019-10-29 21:54 孙小鸟 阅读(4) 评论(0) 推荐(0) 编辑
摘要: Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. Example 1: Input: [ [ 1, 2, 3 ], [ 4, 5, 6 ], 阅读全文
posted @ 2019-08-22 16:35 孙小鸟 阅读(85) 评论(0) 推荐(0) 编辑
摘要: Given a non empty array of digits representing a non negative integer, plus one to the integer. The digits are stored such that the most significant d 阅读全文
posted @ 2019-08-22 16:35 孙小鸟 阅读(73) 评论(0) 推荐(0) 编辑
摘要: Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Inpu 阅读全文
posted @ 2019-08-22 16:35 孙小鸟 阅读(85) 评论(0) 推荐(0) 编辑
摘要: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in place, which 阅读全文
posted @ 2019-08-20 22:19 孙小鸟 阅读(77) 评论(0) 推荐(0) 编辑
摘要: Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numb 阅读全文
posted @ 2019-08-20 22:14 孙小鸟 阅读(90) 评论(0) 推荐(0) 编辑
摘要: Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime com 阅读全文
posted @ 2019-08-20 22:14 孙小鸟 阅读(70) 评论(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 @ 2019-08-20 22:14 孙小鸟 阅读(87) 评论(0) 推荐(0) 编辑
摘要: Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the 阅读全文
posted @ 2019-08-20 20:52 孙小鸟 阅读(82) 评论(0) 推荐(0) 编辑
摘要: 。。。此道算法题的难点在于排除重复项,重复项真的好麻烦。。。 Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c 阅读全文
posted @ 2019-08-19 21:44 孙小鸟 阅读(80) 评论(0) 推荐(0) 编辑