Find three integers in the integer array nums of length n such that the total is as near to goal as possible. Give back the three integers' sum. You may suppose that there is only one possible solution for each input.

Find three integers in the integer array nums of length n such that the total is as near to goal as possible. Give back the three integers' sum. You may suppose that there is only one possible solution for each input.

题目类型: 行为面试题

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

难度: easy

标签: interviewbit, qualcomm, company-specific

目标公司: Qualcomm

参考答案摘要

Example 1: Input: nums = [-1,2,1,-4], target = 1 Output: 2 Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2). Example 2: Input: nums = [0,0,0], target = 1 Output: 0 Finding abs...

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