leetcode[Judge Route Circle]//待整理多种解法
2017-08-26 10:28
525 查看
解法一：
class Solution {
//遍历统计字符串，看左与右的个数是否相同，上与下的个数是否相同
public boolean judgeCircle(String moves) {
int left = 0;
int right = 0;
int up = 0;
int down = 0;
for(int i = 0; i < moves.length(); i++){
switch(moves.charAt(i)){
case 'L' : left++; break;
case 'R' : right++; break;
case 'U' : up++; break;
case 'D' : down++; break;
default : break;
}
}
return left == right && up == down;
}
}
class Solution {
//遍历统计字符串，看左与右的个数是否相同，上与下的个数是否相同
public boolean judgeCircle(String moves) {
int left = 0;
int right = 0;
int up = 0;
int down = 0;
for(int i = 0; i < moves.length(); i++){
switch(moves.charAt(i)){
case 'L' : left++; break;
case 'R' : right++; break;
case 'U' : up++; break;
case 'D' : down++; break;
default : break;
}
}
return left == right && up == down;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode[Longest Palindrome]//待整理多种解法
- leetcode [Convert Sorted Array to Binary Search Tree]//待整理多种解法
- leetcode[K-diff Pairs in an Array]//待整理多种解法
- leetcode [Contains Duplicate II]//待整理多种解法
- leetcode[Construct the Rectangle]//待整理多种解法
- leetcode[First Bad Version]//待整理多种解法
- leetcode [Palindrome Linked List]//待整理多种解法
- leetcode[Sum of Left Leaves]//待整理多种解法
- leetcode [Happy Number]//待整理多种解法
- leetcode [Pascal's Triangle II]//待整理多种解法
- leetcode [Best Time to Buy and Sell Stock II]//待整理多种解法
- leetcode[Convert BST to Greater Tree]//待整理多种解法
- leetcode[Fizz Buzz]//待整理多种解法
- LeetCode 657 Judge Route Circle 判断路线圈
- Leetcode 657 Judge Route Circle
- leetcode [Reverse Linked List]//待整理多种解法
- leetcode[Word Pattern]//待整理多种解法
- leetcode[Ransom Note]//待整理多种解法
- 【LeetCode】Judge Route Circle 判断路径是否成环
- LeetCode之657. Judge Route Circle