[Java] Easy 100% solution
java\nclass Solution {\n    public int furthestDistanceFromOrigin(final String moves) {\n        int l = 0, r = 0;\n\n        for(int i = 0; i < moves.length();
```java\nclass Solution {\n    public int furthestDistanceFromOrigin(final String moves) {\n        int l = 0, r = 0;\n\n        for(int i = 0; i < moves.length(); ++i) {\n            if(moves.charAt(i) == \'L\')\n                l++;\n            else if(moves.charAt(i) == \'R\')\n                r++;\n        }\n\n        return Math.max(l, r) + moves.length() - l - r - Math.min(l, r);\n    }\n}\n```
['Java']