Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] Condition: I != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. in java