Loading the journal
Day 38Medium
LeetCode (4062)
LeetCode (4062)Transform Array Using Pair Operations
Invariant (Sum Preserved)
Problem
Problem Statement
You are given two integer arrays source and target.
In one operation, you may choose two distinct indices i and j in source, along with any integer delta. Then update:
source[i] = source[i] + source[j] - delta
source[j] = delta
Return true if it is possible to make source equal to target after any number of operations (including zero), otherwise false.
Input / Output
Input: source = [1,2,3], target = [0,2,4]
Output: true
Explanation: i = 0, j = 2, delta = 4 → [0, 2, 4]
Input: source = [-5,-5], target = [-15,5]
Output: true
Input: source = [1,2,1], target = [0,2,5]
Output: false
Constraints
2 ≤ source.length == target.length ≤ 10^5
-10^9 ≤ source[i], target[i] ≤ 10^9
Understanding the Problem
Look at what happens to :