Class Solution
-
- All Implemented Interfaces:
public final class Solution3443 - Maximum Manhattan Distance After K Changes.
Medium
You are given a string
sconsisting of the characters'N','S','E', and'W', wheres[i]indicates movements in an infinite grid:'N': Move north by 1 unit.'S': Move south by 1 unit.'E': Move east by 1 unit.'W': Move west by 1 unit.
Initially, you are at the origin
(0, 0). You can change at mostkcharacters to any of the four directions.Find the maximum Manhattan distance from the origin that can be achieved at any time while performing the movements in order.
The Manhattan Distance between two cells <code>(x<sub>i</sub>, y<sub>i</sub>)</code> and <code>(x<sub>j</sub>, y<sub>j</sub>)</code> is <code>|x<sub>i</sub> - x<sub>j</sub>| + |y<sub>i</sub> - y<sub>j</sub>|</code>.
Example 1:
Input: s = "NWSE", k = 1
Output: 3
Explanation:
Change
s[2]from'S'to'N'. The stringsbecomes"NWNE".The maximum Manhattan distance from the origin that can be achieved is 3. Hence, 3 is the output.
Example 2:
Input: s = "NSWWEW", k = 3
Output: 6
Explanation:
Change
s[1]from'S'to'N', ands[4]from'E'to'W'. The stringsbecomes"NNWWWW".The maximum Manhattan distance from the origin that can be achieved is 6. Hence, 6 is the output.
Constraints:
<code>1 <= s.length <= 10<sup>5</sup></code>
0 <= k <= s.lengthsconsists of only'N','S','E', and'W'.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final IntegermaxDistance(String s, Integer k)-
-
Method Detail
-
maxDistance
final Integer maxDistance(String s, Integer k)
-
-
-
-