Class Solution
-
- All Implemented Interfaces:
public final class Solution3618 - Split Array by Prime Indices.
Medium
You are given an integer array
nums.Split
numsinto two arraysAandBusing the following rule:Elements at prime indices in
numsmust go into arrayA.All other elements must go into array
B.
Return the absolute difference between the sums of the two arrays:
|sum(A) - sum(B)|.Note: An empty array has a sum of 0.
Example 1:
Input: nums = 2,3,4
Output: 1
Explanation:
The only prime index in the array is 2, so
nums[2] = 4is placed in arrayA.The remaining elements,
nums[0] = 2andnums[1] = 3are placed in arrayB.sum(A) = 4,sum(B) = 2 + 3 = 5.The absolute difference is
|4 - 5| = 1.
Example 2:
Input: nums = -1,5,7,0
Output: 3
Explanation:
The prime indices in the array are 2 and 3, so
nums[2] = 7andnums[3] = 0are placed in arrayA.The remaining elements,
nums[0] = -1andnums[1] = 5are placed in arrayB.sum(A) = 7 + 0 = 7,sum(B) = -1 + 5 = 4.The absolute difference is
|7 - 4| = 3.
Constraints:
<code>1 <= nums.length <= 10<sup>5</sup></code>
<code>-10<sup>9</sup><= numsi<= 10<sup>9</sup></code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final LongsplitArray(IntArray nums)-
-
Method Detail
-
splitArray
final Long splitArray(IntArray nums)
-
-
-
-