Given an integer array nums, return all triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i]+nums[j]+nums[k] == 0. Note that the solution set must not contain duplicate triplets.

Given an integer array nums, return all triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i]+nums[j]+nums[k] == 0. Note that the solution set must not contain duplicate triplets.

题目类型: 技术面试题

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

难度: easy

标签: interviewbit, qualcomm, company-specific

目标公司: Qualcomm

参考答案摘要

Example 1: Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] Explanation: nums[0] + nums[1] + nums[1] = (-1) + 0 + 1 = 0.nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.nums[0] + nums[3] + nu...

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