小白笔记-----------------------------leetcode53. Maximum Subarray
2017-07-30 18:21
387 查看
public class Solution { public int maxSubArray(int[] nums) { int count = 0; int max = nums[0]; for(int i = 0;i < nums.length;i++){ count = nums[i]; if(count > max){ max = count; } for(int j = i+1;j < nums.length;j++){ count += nums[j]; if(count > max){ max = count; } } } return max; } }
简单的双重游标的思想就ok了
相关文章推荐
- Leetcode解题笔记 53. Maximum Subarray [Easy] 动态规划
- [LeetCode]53. Maximum Subarray
- 小白笔记----------------------------leetcode(237. Delete Node in a Linked List )
- [LeetCode] 53. Maximum Subarray 解题思路
- Leetcode 53. Maximum Subarray
- [LeetCode] 53. Maximum Subarray
- 小白笔记----------------------leetcode(100 Same Tree)
- (Java)LeetCode-53. Maximum Subarray
- leetcode 53. Maximum Subarray
- LeetCode -- 53. Maximum Subarray
- 【leetcode】53. Maximum Subarray 连续子序列的最大和
- LeetCode 53. Maximum Subarray
- 小白笔记----------------------leetcode(9. Palindrome Number)
- leetcode 53. Maximum Subarray
- 小白笔记----------------------------------------leetcode(40. Combination Sum II )
- 小白笔记---------------------------------leetcode(67. Add Binary )
- leetcode--53. Maximum Subarray
- 【LeetCode】53. Maximum Subarray
- leetcode - 53. Maximum Subarray
- leetcode 53. Maximum Subarray python