LEETCODE 53.Maximum Subarray

最新推荐文章于 2024-11-11 20:59:17 发布
最新推荐文章于 2024-11-11 20:59:17 发布
阅读量196 收藏
点赞数
分类专栏： LeetCode 文章标签： leetcode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_44894374/article/details/106340358
版权 
class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
      if max(nums)<0:
          return max(nums)
      local_nums,global_nums = 0,0
      for i in nums:
          local_nums=max (0,local_nums+i)
          global_nums=max (local_nums,global_nums)
      return global_nums

 

吴帆_Wu.F
关注
专栏目录
【LeetCode】10. Maximum Subarray·最大子数组和
aqin1012的博客
07-14 212
给你一个整数数组 nums ，请你找出一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。 子数组 是数组中的一个连续部分。
LeetCode 53. Maximum Subarray
款子哥的博客
11-12 266
53. Maximum Subarray 题目链接 分析过程 由题意，需要在给出的数组中，找出和最大的连续子数组。 解法一（不推荐） 暴力枚举。通过双重 for 循环，计算所有子数组的和，其中最大的和即为该题的结果。 代码实现略过。在 LeetCode 中，以该方式提交会导致超时。 解法二（推荐） 动态规划（DP）。将原问题转为子问题：寻找前序子数组和当前数字和最大的组合。当前数字的值无法被主观控制，而前序子数组的和可以控制。因此，为达到和最大的情况，需要确保前序子数组的和大于 0，否则它就是在“帮倒忙”。
Leetcode 53. Maximum Subarray
weixin_58080442的博客
04-21 318
Given an integer arraynums, find the contiguous subarray (containing at least one number) which has the largest sum and returnits sum. Asubarrayis acontiguouspart of an array. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanati...
LeetCode53. Maximum Subarray
abs130130的博客
10-11 167
【代码】LeetCode53. Maximum Subarray。
LeetCode 53. Maximum Subarray（最大子数组）
James Pan
05-21 1293
原题网址：https://leetcode.com/problems/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
LeetCode 53. Maximum Subarray（Easy）
Katrina_Pan的博客
03-02 464
Maximum Subarray（Easy）Description 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 con
LeetCode 53.Maximum Subarray
weixin_44610959的博客
08-29 158
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6. Follow up: If you h
leetcode 53. Maximum Subarray
bohu83的博客
09-27 215
一 题目 Given an integer arraynums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum. Example: Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 E...
[LeetCode]53.Maximum Subarray
SmartSi
01-27 2692
【题目】 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,
java-leetcode题解之Maximum Subarray Sum with One Deletion.java
10-22
java java_leetcode题解之Maximum Subarray Sum with One Deletion.java
LeetCode 53. Maximum Subarray--连续子数组的最大和,输出左右2个下标/输出区间的开始和结束下标-动态规划-Math.max(sum + nums[i], nums[i])
Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发
08-23 573
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]ha
53. Maximum Subarray （Kadane算法 / 动态规划 / 分治法）
yesr的博客
11-02 506
Maximum Subarray 【题目】 Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Input: [-2,1,-3,4,-1,2,1,-5...
Leetcode 1567. Maximum Length of Subarray With Positive Product (python)
qq_37821701的博客
10-25 548
Leetcode 1567. Maximum Length of Subarray With Positive Product题目：解法1：解法2：two pass 题目： 解法1： 这种判断正负的题目往往都是通过正负得负，负负得正这样的方式来进行交换得到的，之前也有过类似的题目：比如Leetcode 152 Maximum Product Subarray 这题具体的解析如下： The main idea here is to keep a count of running positive array
动态规划习题其七【力扣】【算法学习day.29】
最新发布
2301_79232523的博客
11-11 167
##我做这类文档一个重要的目的还是给正在学习的大家提供方向（例如想要掌握基础用法，该刷哪些题？）我的解析也不会做的非常详细，只会提供思路和一些关键点，力扣上的大佬们的题解质量是非常非常高滴！！！
Leetcode 3352. Count K-Reducible Numbers Less Than N
codename_cys的博客
11-11 485
Leetcode 3352. Count K-Reducible Numbers Less Than N
LeetCode 143.重排链表
qq_57349657的博客
11-10 249
链表快慢指针 练习题 ： 重排链表
Java | Leetcode Java题解之第551题学生出勤记录I
m0_57195758的博客
11-09 363
Java | Leetcode Java题解之第551题学生出勤记录I
leetcode 3254 长度为 K 的子数组的能量值 I 中等
2401_88085478的博客
11-06 322
【代码】leetcode 3254 长度为 K 的子数组的能量值 I 中等。
LeetCode 876.链表的中间结点
qq_57349657的博客
11-08 264
链表快慢指针 练习题 ： 链表的中间结点
leetcode热题100刷题顺序
03-30
1. Two Sum 2. Add Two Numbers 3. Longest Substring Without Repeating Characters 4. Median of Two Sorted Arrays 5. Longest Palindromic Substring 6. ZigZag Conversion 7. Reverse Integer 8. String to Integer (atoi) 9. Palindrome Number 10. Regular Expression Matching 11. Container With Most Water 12. Integer to Roman 13. Roman to Integer 14. Longest Common Prefix 15. 3Sum 16. 3Sum Closest 17. Letter Combinations of a Phone Number 18. 4Sum 19. Remove Nth Node From End of List 20. Valid Parentheses 21. Merge Two Sorted Lists 22. Generate Parentheses 23. Swap Nodes in Pairs 24. Reverse Nodes in k-Group 25. Remove Duplicates from Sorted Array 26. Remove Element 27. Implement strStr() 28. Divide Two Integers 29. Substring with Concatenation of All Words 30. Next Permutation 31. Longest Valid Parentheses 32. Search in Rotated Sorted Array 33. Search for a Range 34. Find First and Last Position of Element in Sorted Array 35. Valid Sudoku 36. Sudoku Solver 37. Count and Say 38. Combination Sum 39. Combination Sum II 40. First Missing Positive 41. Trapping Rain Water 42. Jump Game 43. Merge Intervals 44. Insert Interval 45. Unique Paths 46. Minimum Path Sum 47. Climbing Stairs 48. Permutations 49. Permutations II 50. Rotate Image 51. Group Anagrams 52. Pow(x, n) 53. Maximum Subarray 54. Spiral Matrix 55. Jump Game II 56. Merge k Sorted Lists 57. Insertion Sort List 58. Sort List 59. Largest Rectangle in Histogram 60. Valid Number 61. Word Search 62. Minimum Window Substring 63. Unique Binary Search Trees 64. Unique Binary Search Trees II 65. Interleaving String 66. Maximum Product Subarray 67. Binary Tree Inorder Traversal 68. Binary Tree Preorder Traversal 69. Binary Tree Postorder Traversal 70. Flatten Binary Tree to Linked List 71. Construct Binary Tree from Preorder and Inorder Traversal 72. Construct Binary Tree from Inorder and Postorder Traversal 73. Binary Tree Level Order Traversal 74. Binary Tree Zigzag Level Order Traversal 75. Convert Sorted Array to Binary Search Tree 76. Convert Sorted List to Binary Search Tree 77. Recover Binary Search Tree 78. Sum Root to Leaf Numbers 79. Path Sum 80. Path Sum II 81. Binary Tree Maximum Path Sum 82. Populating Next Right Pointers in Each Node 83. Populating Next Right Pointers in Each Node II 84. Reverse Linked List 85. Reverse Linked List II 86. Partition List 87. Rotate List 88. Remove Duplicates from Sorted List 89. Remove Duplicates from Sorted List II 90. Intersection of Two Linked Lists 91. Linked List Cycle 92. Linked List Cycle II 93. Reorder List 94. Binary Tree Upside Down 95. Binary Tree Right Side View 96. Palindrome Linked List 97. Convert Binary Search Tree to Sorted Doubly Linked List 98. Lowest Common Ancestor of a Binary Tree 99. Lowest Common Ancestor of a Binary Search Tree 100. Binary Tree Level Order Traversal II
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值