problem

657.?Robot Return to Origin

題意：

solution1:

class Solution { public:bool judgeCircle(string moves) {int cnt1 = 0, cnt2 = 0;for(auto move:moves){if(move == 'L') cnt1++;else if(move=='R') cnt1--;else if(move=='U') cnt2++;else if(move=='D') cnt2--;}if(cnt1==0 && cnt2==0) return true;else return false;} };

solution2:

class Solution { public:bool judgeCircle(string moves) {unordered_map<char, int> mymap;for(auto move:moves) mymap[move]++;//return (mymap.count('L')==mymap.count('R') && mymap.count('U')==mymap.count('D'));return mymap['L']==mymap['R'] && mymap['U']==mymap['D'];} };

?

參考

1. Leetcode_easy_657.?Robot Return to Origin;

完

?

轉(zhuǎn)載于:https://www.cnblogs.com/happyamyhope/p/11091098.html

總結(jié)

以上是生活随笔為你收集整理的【Leetcode_easy】657. Robot Return to Origin的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。