Leetcode 657 Judge Route Circle

最新推荐文章于 2024-10-05 12:29:44 发布

哀酱

最新推荐文章于 2024-10-05 12:29:44 发布

阅读量408

点赞数

分类专栏： LeetCode(c++&python) 文章标签： leetcode c++

本文链接：https://blog.csdn.net/u010821666/article/details/77929372

版权

LeetCode(c++&python) 专栏收录该内容

136 篇文章 0 订阅

订阅专栏

Leetcode 657 Judge Route Circle

#include <string>
using namespace std;

//too slow
class Solution {
public:
    bool judgeCircle(string moves) {
      string counts = "0000";
      for(int i = 0;i <moves.size();i++)
      {
      if(moves[i] == 'R')
        counts[0] ++;
      if(moves[i] == 'L')
        counts[1] ++;
      if(moves[i] == 'U')
        counts[2] ++;
      if(moves[i] == 'D')
        counts[3] ++;
      }

      return(counts[0] == counts[1] && counts[2] == counts[3]);
    }

};

//refine it
class Solution2 {
private:
      int directionCount(string s,char c)//the difference of using s vs &s?
      {
      int pos = 0;
      int ret = 0;
      while((pos = s.find(c,pos)) != string::npos)//don't find the entire string (entire string pos = 0)
      {
        ret ++;
        pos ++;
      }
      return ret;
      }

public:
    bool judgeCircle(string moves) {
        int count[4];
        count[0] = directionCount(moves, 'U');
        count[1] = directionCount(moves, 'D');
        count[2] = directionCount(moves, 'L');
        count[3] = directionCount(moves, 'R');
        if(count[0] == count[1] && count[2] == count[3])
            return true;
        return false;
    }
};