LeetCode 657. Judge Route Circle
problem:
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
first:
import java.util.Stack;
class Solution {
public boolean judgeCircle(String moves) {
Stack<Character> stack = new Stack<Character>();
for(int i=0;i<moves.length();i++){
if(stack.size()==0){
stack.push(moves.charAt(i));
} else if(stack.peek()=='U'&&moves.charAt(i)=='D'||
stack.peek()=='D'&&moves.charAt(i)=='U'||
stack.peek()=='L'&&moves.charAt(i)=='R'||
stack.peek()=='R'&&moves.charAt(i)=='L'){
stack.pop();
} else {
stack.push(moves.charAt(i));
}
}
return stack.empty() ? true : false;
}
}
result:
2:
import java.util.Stack; class Solution { public boolean judgeCircle(String moves) { int rCounts=0, lCounts=0,dCounts=0,uCounts=0; for(int i=0;i<moves.length();i++){ if(moves.charAt(i)=='U'){ uCounts++; } if(moves.charAt(i)=='D'){ dCounts++; } if(moves.charAt(i)=='R'){ rCounts++; } if(moves.charAt(i)=='L'){ lCounts++; } } return uCounts==dCounts&&rCounts==lCounts ? true : false; } }
result:
参考答案:
class Solution { public boolean judgeCircle(String moves) { int x = 0, y = 0; for (char move: moves.toCharArray()) { if (move == 'U') y--; else if (move == 'D') y++; else if (move == 'L') x--; else if (move == 'R') x++; } return x == 0 && y == 0; } }
result:
retry:
class Solution { public boolean judgeCircle(String moves) { int rCounts=0, lCounts=0,dCounts=0,uCounts=0; char[] charArray = moves.toCharArray(); for(int i=0;i<charArray.length;i++){ if(charArray[i]=='U'){ uCounts++; } if(charArray[i]=='D'){ dCounts++; } if(charArray[i]=='R'){ rCounts++; } if(charArray[i]=='L'){ lCounts++; } } return uCounts==dCounts&&rCounts==lCounts ? true : false; } }
result:
conclusion:
可见把String转换成char数组后效率更高。
分类:
LeetCode
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· 周边上新:园子的第一款马克杯温暖上架
· Open-Sora 2.0 重磅开源!
· 分享 3 个 .NET 开源的文件压缩处理库,助力快速实现文件压缩解压功能!
· Ollama——大语言模型本地部署的极速利器
· DeepSeek如何颠覆传统软件测试?测试工程师会被淘汰吗?