Problem
Maria plays college basketball and wants to go pro. Each season she maintains a record of her play. She tabulates the number of times she breaks her season record for most points and least points in a game. Points scored in the first game establish her record for the season, and she begins counting from there.
For example, assume her scores for the season are represented in the array . Scores are in the same order as the games played. She would tabulate her results as follows:
Count
Game Score Minimum Maximum Min Max
0 12 12 12 0 0
1 24 12 24 0 1
2 10 10 24 1 1
3 24 10 24 1 1
Given Maria's scores for a season, find and print the number of times she breaks her records for most and least points scored during the season.
Function Description
Complete the breakingRecords function in the editor below. It must return an integer array containing the numbers of times she broke her records. Index is for breaking most points records, and index is for breaking least points records.
breakingRecords has the following parameter(s):
- scores: an array of integers
Input Format
The first line contains an integer , the number of games.
The second line contains space-separated integers describing the respective values of .
Constraints
Output Format
Print two space-seperated integers describing the respective numbers of times her best (highest) score increased and her worst (lowest) score decreased.
Sample Input 0
9
10 5 20 20 4 5 2 25 1
Sample Output 0
2 4
Explanation 0
The diagram below depicts the number of times Maria broke her best and worst records throughout the season:
She broke her best record twice (after games and ) and her worst record four times (after games , , , and ), so we print 2 4
as our answer. Note that she did not break her record for best score during game , as her score during that game was notstrictly greater than her best record at the time.
Sample Input 1
10
3 4 21 36 10 28 35 5 24 42
Sample Output 1
4 0
Explanation 1
The diagram below depicts the number of times Maria broke her best and worst records throughout the season:
She broke her best record four times (after games , , , and ) and her worst record zero times (no score during the season was lower than the one she earned during her first game), so we print 4 0
as our answer.
How I solved the problem
# 최대값과 최소값을 저장하는 변수와 최대값과 최소값이 갱신되는 횟수를 저장하는 변수, 총 4개의 변수가 필요함.
# 최대값과 최소값은 scores 변수의 첫 번째 값으로 초기화를 한 뒤에 진행하는 것이 올바름!
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 | 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 breakingRecords function below. static int[] breakingRecords(int[] scores) { int maxCount = 0; int minCount = 0; //how many min number record int maxNum = scores[0]; //max number initialize int minNum = scores[0]; //min number initialize for (int i = 0; i < scores.length; i++) { if (scores[i] > maxNum) { maxNum = scores[i]; maxCount++; } if (scores[i] < minNum) { minNum = scores[i]; minCount++; } } int[] breakingRecord = new int[2]; breakingRecord[0] = maxCount; breakingRecord[1] = minCount; return breakingRecord; } 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])?"); int[] scores = new int[n]; String[] scoresItems = scanner.nextLine().split(" "); scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?"); for (int i = 0; i < n; i++) { int scoresItem = Integer.parseInt(scoresItems[i]); scores[i] = scoresItem; } int[] result = breakingRecords(scores); for (int i = 0; i < result.length; i++) { bufferedWriter.write(String.valueOf(result[i])); if (i != result.length - 1) { bufferedWriter.write(" "); } } bufferedWriter.newLine(); bufferedWriter.close(); scanner.close(); } } | cs |
[출처 : https://www.hackerrank.com ]
'1 Day 1 Algorithms' 카테고리의 다른 글
[2019.02.11] Divisible Sum Pairs (0) | 2019.02.11 |
---|---|
[2019.02.08] Birthday Chocolate (0) | 2019.02.08 |
[2019.01.31] Between Two Sets (0) | 2019.01.31 |
[2019.01.30] Kangaroo (0) | 2019.01.30 |
[2019.01.29] Apple and Orange (0) | 2019.01.29 |
댓글