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. Counting Valleys
  5. Discussions

Counting Valleys

  • sansijayy
     + 0 comments

    **Logic to solve the problem is if the previous step was a "U" and the sealevel count becomes 0 it is a valley. **

            int sealevel = 0;
        int valley = 0;
        char[] charPath = path.toCharArray();
        for (int i = 0; i < steps ; i++) {
            if (charPath[i]=='U'){
                sealevel++;
                if(sealevel==0) valley++;
            } 
            if (charPath[i]=='D') sealevel--;
        }
        return valley;
    }
}