题目很简单:本质上就是判断上下左右的次数是否相等
class Solution {
public:bool judgeCircle(string moves) {
int up_count =0;
int dow_count =0;
int r_count=0;
int l_count=0;
for(string::iterator iter=moves.begin();iter!=moves.end();iter++)
{
if((*iter)=='R')
r_count++;
else if((*iter)=='L')
l_count++;
else if ((*iter)=='U')
up_count++;
else if((*iter)=='D')
dow_count++;
}
if(l_count == r_count && up_count == dow_count)
return true;
return false;
}
};
409



被折叠的 条评论
为什么被折叠?



