- 博客(4)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode解题报告 53. Maximum Subarray [medium]
题目描述 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. Example: given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2
2016-09-17 00:13:30
247
原创 LeetCode解题报告 169. Majority Element [easy]
题目描述 Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majorit
2016-09-13 00:16:37
271
原创 LeetCode解题报告 6. ZigZag Conversion［easy]
题目描述 The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H
2016-09-06 15:33:24
370
原创 LeetCode解题报告 1. Two Sum［easy]
前言 之前听说过很多次LeetCode在面试中的大量应用，通过本次算法课可以开始题目的练习觉得还是很不错的。 题目描述1. Two Sum［easy] Given an array of integers, return indices of the two numbers such that they add up to a specific target.
2016-09-03 16:48:08
649
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人