摘要：
最大子矩阵 1,借助最大连续子序列和来取得最大子矩阵 def MaxSubArray(nums): n = len(nums) dp = [] dp.append(nums[0]) mymax = dp[0] startidx = 0 endidx = 0 for i in range(1, n): 阅读全文
posted @ 2020-09-18 13:30
Leon呀
阅读(169)
评论(0)
推荐(0)
摘要：
最大子数组 1,暴力法 def getMaxNumList(numlist): max=0 curtotal=0 startidx = 0 endidx = 0 mylen = len(numlist) for idx in range(mylen): curtotal = 0 curtotal + 阅读全文
posted @ 2020-09-18 10:55
Leon呀
阅读(175)
评论(0)
推荐(0)
浙公网安备 33010602011771号