HackkerRank - Mars Exploration, Running Time of Algorithms, HackerRank in a String!

---

[풀이 - Mars Exploration] : <Easy / 94.30%>

int marsExploration(string s)
{
    int result = 0;
    string signal = "SOS";
    //
    for(int i = 0; i < s.size(); ++i)
    {
        if(s[i] != signal[i % 3])
            ++result;
    }
    //
    return result;
}

 

---

[풀이 - Running Time of Algorithms] : <Easy / 95.97%>

int runningTime(vector<int> arr)
{
    int result = 0;
    int count = arr.size();
    //
    for(int i = 0; i < count; ++i)
    {
        while((arr[i-1] > arr[i]) && (i > 0))
        {
            swap(arr[i-1], arr[i]);
            //
            --i;
            ++result;
        }
    }
    //
    return result;
}

 

---

[풀이 - HackerRank in a String!] : <Easy / 91.74%>

string hackerrankInString(string s)
{
    string sequance = "hackerrank";
    int idx = 0;
    //
    int count = s.size();
    for(int i = 0; i < count; ++i)
    {
        if(s[i] == sequance[idx])
            ++idx;
    }
    //
    if(idx == sequance.size())
        return "YES";
    else
        return "NO";
}