657. Judge Route Circle

Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.

The move sequence is represented by a string. And each move is represent by a character. The valid robot moves are R (Right), L (Left), U (Up) and D (down). The output should be true or false representing whether the robot makes a circle.

Example 1:
Input: "UD"
Output: true
Example 2:
Input: "LL"
Output: false

很簡單的一題,估計(jì)是AC率最高的一題了吧。

class Solution {
    public boolean judgeCircle(String moves) {
        if(moves==null||moves.length()==0)
            return false;
             int upCount = 0 ;
            int rightCount = 0 ;
        for(int i = 0 ;i<moves.length();i++)
        {
            char ch = moves.charAt(i);
            switch(ch)
            {
               case('U'): upCount++;
                    break;
              case('D'):
                  upCount--;
                    break;
              case('R'):
                  rightCount++;
                    break;
              case('L'):    
                  rightCount--;
                    break;
                default:
                   break;
            }
            
        }
        return upCount==0&&rightCount==0;
    }
}
最后編輯于
?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請聯(lián)系作者
平臺聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點(diǎn),簡書系信息發(fā)布平臺,僅提供信息存儲(chǔ)服務(wù)。

推薦閱讀更多精彩內(nèi)容