Programmers [Java] - Lv. 0 : 수열과 구간 쿼리 2

 

 

class Solution
{
	public int[] solution(int[] arr, int[][] queries)
	{
		int[] result = new int[queries.length];
		int[] insertCnt = new int[result.length];
		
		for(int j = 0; j < queries.length; j ++)
		{
			for (int i = 0; i < arr.length; i ++)
			{
				int stRange = queries[j][0];
				int endRange = queries[j][1];
				int moreThan = queries[j][2];
				if (stRange <= i && i <= endRange)
				{
					if (arr[i] > moreThan)
					{
						insertCnt[j] += 1;
						
						if (insertCnt[j]>= 2 && result[j] > arr[i])
						{
							result[j] = arr[i];
						}
						else if (insertCnt[j] == 1)
						{
							result[j] = arr[i];
						}
						
					}
				}
				
			}// end for i
			
			
		}// end for j
		
		for (int i = 0; i < insertCnt.length; i ++)
		{
			if (insertCnt[i] == 0)
			{
				result[i] = -1;
			}
		}
		
		return result;
	}
}