Leetcode 2769. Find the Maximum Achievable Number

Find the largest integer x that can be transformed into num in at most t operations, where each operation independently increments or decrements both x and num (so their difference changes by 0 or ±2). Equivalently, maximize x subject to x - num being even and |x - num| ≤ 2t.