Last active
April 6, 2019 07:22
-
-
Save namthatman/4794b882ef2ab3ced18cbd0fb3238abc to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.io.*; | |
| import java.math.*; | |
| import java.security.*; | |
| import java.text.*; | |
| import java.util.*; | |
| import java.util.concurrent.*; | |
| import java.util.regex.*; | |
| public class Solution { | |
| // Complete the countingValleys function below. | |
| static int countingValleys(int n, String s) { | |
| int level = 0; | |
| int valley = 0; | |
| for (int i = 0; i < n; i++) { | |
| if (s.charAt(i) == 'D') { | |
| level--; | |
| } | |
| else { //s.charAt(i) == 'U' | |
| if (level == -1) { | |
| valley++; | |
| } | |
| level++; | |
| } | |
| } | |
| return valley; | |
| } | |
| private static final Scanner scanner = new Scanner(System.in); | |
| public static void main(String[] args) throws IOException { | |
| BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH"))); | |
| int n = scanner.nextInt(); | |
| scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?"); | |
| String s = scanner.nextLine(); | |
| int result = countingValleys(n, s); | |
| bufferedWriter.write(String.valueOf(result)); | |
| bufferedWriter.newLine(); | |
| bufferedWriter.close(); | |
| scanner.close(); | |
| } | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike | |
| he took exactly n steps. For every step he took, he noted if it was an uphill, U, or a downhill, D step. Gary's hikes start and end at | |
| sea level and each step up or down represents a 1 unit change in altitude. We define the following terms: | |
| A mountain is a sequence of consecutive steps above sea level, starting with a step up from sea level and ending with a step down to | |
| sea level. | |
| A valley is a sequence of consecutive steps below sea level, starting with a step down from sea level and ending with a step up to sea | |
| level. | |
| Given Gary's sequence of up and down steps during his last hike, find and print the number of valleys he walked through. | |
| For example, if Gary's path is s = [DDUUUUDD], he first enters a valley 2 units deep. Then he climbs out an up onto a mountain 2 units | |
| high. Finally, he returns to sea level and ends his hike. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment