leetcode
晴天丶1
这个作者很懒,什么都没留下…
展开
-
leetcode 53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has th原创 2017-11-09 10:45:43 · 131 阅读 · 0 评论 -
leetcode 11. Container With Most Water
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lin原创 2017-11-04 11:14:20 · 117 阅读 · 0 评论 -
leetcode 27.Remove Element
Given an array and a value, remove all instances of that value in place and return the new length. 给定一个数列和一个值,将等于这个值的元素移除并返回最后的数列长度。思路 我首先想到的办法是用一个index, i去遍历数组,若是不等于给定的值,就将另一个index, start所处的位置的值,等于i原创 2017-11-03 00:18:59 · 107 阅读 · 0 评论 -
leetcode 20. Valid Parentheses
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()” and “()[]{}” are all valid but原创 2017-11-18 10:49:11 · 129 阅读 · 0 评论 -
leetcode 101. Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 /原创 2017-11-28 22:21:42 · 132 阅读 · 0 评论 -
leetcode 38. Count and Say
The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221 1 is read off as “one 1” or 11. 11 is read o原创 2017-11-22 22:38:57 · 116 阅读 · 0 评论