2833. Furthest Point From Origin
Problem Statement
You are given a string moves
of length n
consisting only of characters 'L'
, 'R'
, and '_'
. The string represents your movement on a number line starting from the origin 0
.
In the ith
move, you can choose one of the following directions:
move to the left if
moves[i] = 'L'
ormoves[i] = '_'
move to the right if
moves[i] = 'R'
ormoves[i] = '_'
Return the distance from the origin of the furthest point you can get to after n
moves.
Example 1:
Input: moves = "L_RL__R"
Output: 3
Explanation: The furthest point we can reach from the origin 0 is point -3 through the following sequence of moves "LLRLLLR".
Example 2:
Input: moves = "_R__LL_"
Output: 5
Explanation: The furthest point we can reach from the origin 0 is point -5 through the following sequence of moves "LRLLLLL".
Example 3:
Input: moves = "_______"
Output: 7
Explanation: The furthest point we can reach from the origin 0 is point 7 through the following sequence of moves "RRRRRRR".
Constraints:
1 <= moves.length == n <= 50
moves
consists only of characters'L'
,'R'
and'_'
.
Intuition
Approach:
LLLR____
3 -> L ; and 1 R
3-1 = 2 Hence we get 2 on left so fill all the _ with L
Thats the logic
Links
https://leetcode.com/problems/furthest-point-from-origin/description/
Video Links
Approach 1:
class Solution {
public:
int furthestDistanceFromOrigin(string moves) {
unordered_map<char, int> count;
for(auto c: moves)
count[c]++;
return max(count['L'],count['R']) - min(count['L'], count['R']) + count['_'];
}
};
Approach 2:
Approach 3:
Approach 4:
Similar Problems
Last updated