09 2021 档案
[Leetcode 152]最大乘积子串Maximum Product Subarray 踩坑
摘要:【题目】 一串int数组中找到乘积最大的子串,子串必须连续,返回成绩ans Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, 阅读全文
posted @ 2021-09-04 17:46 alau 阅读(66) 评论(0) 推荐(0)