We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Larry's Array
  5. Discussions

Larry's Array

  • alban_tyrex
     + 0 comments

    Here is my c++ solution 

    string larrysArray(vector<int> A) {
    if(A.size() == 2 && A[0] > A[1]) return "NO";
    else if(A.size() == 1 || A.size() == 0) return "YES";
    else {
        auto min_it = std::min_element(A.begin(), A.end());
        int tempIndex = distance(A.begin(), min_it);
        A.erase(A.begin() +  tempIndex);
        if(tempIndex % 2 != 0){
            swap(A[0], A[1]);
        }
        return larrysArray(A);
    }
}