Check a Robot end it's path to starting point

There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.

The move sequence is represented by a string, and the character moves[i] represents its ith move. Valid moves are R (right), L (left), U (up), and D (down). If the robot returns to the origin after it finishes all of its moves, return true. Otherwise, return false.

Method 1:-

import java.util.*;

class Solution {
    public boolean check(String moves) {
        Map<Character,Integer>mp=new HashMap<>();
        mp.put('U',0);
        mp.put('D',0);
        mp.put('L',0);
        mp.put('R',0);
        for(int i=0;i<moves.length();i++)
        {
            if(mp.containsKey(moves.charAt(i)))
                mp.put(moves.charAt(i),mp.get(moves.charAt(i))+1);
        }
        if((mp.get('U').equals(mp.get('D')))&&(mp.get('L').equals(mp.get('R'))))
            return true;
        return false;
    }

public static void main(String args[])

   {
       Scanner sc=new Scanner(System.in);
       String s=sc.next();
       System.out.println(check(s)); 
   }
}

Method 2:-

import java.util.*;
class Solution {
    public static boolean check(String moves) {
        if(moves == null || moves.length() == 0)
            return true;
        int up = 0, left = 0;
        for(int i=0;i<moves.length();i++)
        {
            if(moves.charAt(i) == 'U')
                up++;
            else if(moves.charAt(i) == 'D')
                up--;
            else if(moves.charAt(i) == 'L')
                left++;
            else
                left--;
        }
        return up == 0 && left == 0;
    }

   public static void main(String args[])

   {
       Scanner sc=new Scanner(System.in);
       String s=sc.next();
       System.out.println(check(s)); 
   }

 }