[SW Expert Academy] [S/W 문제해결 기본] 1일차 - View (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV134DPqAA8CFAYh&categoryId=AV134DPqAA8CFAYh&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=7

SW Expert Academy

 

while문으로 해결

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		for (int tc = 1; tc <= 10; tc++) {

			int n = sc.nextInt();

			int arr[] = new int[n];
			int count = 0;

			for (int i = 0; i < n; i++) {
				arr[i] = sc.nextInt();
			}

			for (int i = 2; i < n - 2; i++) {
				int num = arr[i];

				int left1 = arr[i - 1];
				int left2 = arr[i - 2];

				int right1 = arr[i + 1];
				int right2 = arr[i + 2];

				while (true) {

					if (num > left1 && num > left2 && num > right1 && num > right2) {
						count++;
						num--;
					} else {
						break;
					}

				}

			}

			System.out.println("#" + tc + " " + count);

		}

	}
}

 

 

max값과 비교해서 해결

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		for (int tc = 1; tc <= 10; tc++) {

			int n = sc.nextInt();

			int arr[] = new int[n];
			int count = 0;

			for (int i = 0; i < n; i++) {
				arr[i] = sc.nextInt();
			}

			for (int i = 2; i < n - 2; i++) {
				int num = arr[i];

				int left1 = arr[i - 1];
				int left2 = arr[i - 2];

				int right1 = arr[i + 1];
				int right2 = arr[i + 2];

				int maxNeighbor = Integer.MIN_VALUE;

				if (num > left1 && num > left2 && num > right1 && num > right2) {
					maxNeighbor = Math.max(Math.max(left1, left2), Math.max(right1, right2));

					count += num - maxNeighbor;
				}

			}

			System.out.println("#" + tc + " " + count);

		}

	}
}

 

while문을 계속해서 돌리는 것보단 밑 코드가 더 합리적인 것 같다.

 

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		for (int tc = 1; tc <= 10; tc++) {
			int n = sc.nextInt();

			int arr[] = new int[n];

			int sum = 0;

			for (int i = 0; i < n; i++) {
				arr[i] = sc.nextInt();
			}

			for (int i = 2; i < n - 2; i++) {

				int max = Integer.MIN_VALUE;

				for (int j = i - 2; j <= i + 2; j++) {
					if (j == i)
						continue;
					max = Math.max(max, arr[j]);
				}

				if (max < arr[i]) {
					sum += arr[i] - max;
				}

			}
			
			System.out.println("#"+tc+" "+sum);

		}

	}
}