Judge Route Circle
来源:互联网 发布:整理桌面软件 编辑:程序博客网 时间:2024/05/22 10:24
public:
bool judgeCircle(string moves) {
string moves="0";
for(i==0;i<=moves.size();i++)
{
if(moves[i]=='U')
a=a++;
if(moves[i]='D')
b=b++;
if(moves[i]=='L')
c=c++;
if(moves[i]=='R')
int d=d++;
return (a==b&&c=d);
}
}
};
报错:
第一次修改:
class Solution {
public:
bool judgeCircle(string moves) {
string count="0";
for(i==0;i<=moves.size();i++)
{
if(moves[i]=='U')
count[0]++;
if(moves[i]='D')
count[1]++;
if(move1[i]=='L')
count[2]++;
if(moves[i]=='R')
count[3]++;
return (count[0]==count[2]&&count[0]==count[0]);
}
}
};
报错:
第三次改:
class Solution {
public:
bool judgeCircle(string moves) {
string count="0";
for(int i=0;i<=moves.size();i++)
{
if(moves[i]=='U')
count[0]++;
if(moves[i]='D')
count[1]++;
if(moves[i]=='L')
count[2]++;
if(moves[i]=='R')
count[3]++;
return (count[0]==count[2]&&count[0]==count[0]);
}
}
};
报错:
为啥,原来,return要在for循环外面:
class Solution {
public:
bool judgeCircle(string moves) {
string count="0000";
for(int i=0;i<moves.size();i++)
{
if(moves[i]=='U')
count[0]++;
if(moves[i]=='D')
count[1]++;
if(moves[i]=='L')
count[2]++;
if(moves[i]=='R')
count[3]++;
}
return (count[0]==count[1] && count[2]==count[3]);
}
};
而且必须要四个0,编程的各种陋习得改
- leetcode657: Judge Route Circle
- Leetcode657. Judge Route Circle
- Judge Route Circle
- Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- LeetCode---Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- 657.Judge Route Circle
- Judge Route Circle(leetcode)
- 657. Judge Route Circle
- 高通平台LCM相关专业术语首字母缩写Acronyms(不断更新。。。)
- 自我参考-Java面向对象(下)
- python中对类的理解
- 类和对象
- 【正念奇迹】-ZQ0014-《高绩效教练》
- Judge Route Circle
- Java使用线程池批量顺序执行任务
- 太上感应篇0021
- RPC框架 及 RMI
- 2016年计算机联考真题——寻求最大子集和的差
- [数位DP] Codeforces 809C Round #415 (Div. 1) C. Find a car
- Unity官方教程—space shooter练习日记之脚色移动
- Android Studio目录结构及工程项目结构解析
- 基于springboot+vue+element+ueditor实现前后端分离的富文本框实现