通过一道leetcode练习switch case

题目的链接

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

函数代码

bool judgeCircle(char* moves) {
    int a, b, i;
    a = 0;
    b = 0;
    i = 0;
    while (moves[i] != 0) {
        switch (moves[i]) {
        case'U':a++;
            break;
        case'D':a--;
            break;
        case'L':b++;
            break;
        case'R':b--;
            break;
        }
        i++;
    }
    if (a == 0 && b == 0)
        return true;
    else
        return false;
}

之前刚刚把if else结构转换为switch case时犯了两个小错误，一个是不小心把外面的while循环一并删除了，另外一个是没有在每一个case语句后面加上break。如果不加break，在执行完这个case语句后是默认继续往下进行的。