Find the largest contiguous subarray (containing at least one number) of an integer array nums and return its value. An array subrange is a contiguous portion of an array.

Find the largest contiguous subarray (containing at least one number) of an integer array nums and return its value. An array subrange is a contiguous portion of an array.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, qualcomm, company-specific

目标公司: Qualcomm

参考答案摘要

Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6. Example 2: Input: nums = [1] Output: 1 Example 3: Input: nums = [5,4,-1,7,8] Output: 23 Solu...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。