• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2801_2900.s2833_furthest_point_from_origin.readme.md Maven / Gradle / Ivy

2833\. Furthest Point From Origin

Easy

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'` or `moves[i] = '_'`
*   move to the right if `moves[i] = 'R'` or `moves[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 `'_'`.