소스코드 

List<Integer> AList = new ArrayList<Integer>();
for(int i= 0 ; i < A.length ; i ++){
	AList.add(A[i]);
}
Collections.sort(AList);

int result = 1;
if(AList.get(0) != 1){
	result = 0;
}
else{
	if(AList.size() > 1){
		for(int i = 1 ; i < AList.size() ; i ++){
			if((AList.get(i) - AList.get(i-1)) != 1){
				result = 0;
				break;
			}
		}
	}
}

System.out.println(result);

'공부-codility' 카테고리의 다른 글

[Lesson] 4. FrogRiverOne  (0) 2022.08.08
[Lesson] 3. TapeEquilibrium  (0) 2022.08.04
[Lesson] 3. PermMissionElem  (0) 2022.08.04
[Lesson] 3. FrogJmp  (0) 2022.08.04
[Lesson] 2. Arrays - OddOccurrencesInArray  (0) 2022.08.04

소스코드 

Map<Integer, Integer> xCnt = new HashMap();
int cntResult = -1;
for(int i = 0; i < A.length ; i ++){
	if(A[i] <= X){
		xCnt.put(A[i], 0);
		if(xCnt.size() == X){
			cntResult = i;
			break;
		}
	}
}

System.out.println(cntResult);

'공부-codility' 카테고리의 다른 글

[Lesson] 4. PermCheck  (0) 2022.08.08
[Lesson] 3. TapeEquilibrium  (0) 2022.08.04
[Lesson] 3. PermMissionElem  (0) 2022.08.04
[Lesson] 3. FrogJmp  (0) 2022.08.04
[Lesson] 2. Arrays - OddOccurrencesInArray  (0) 2022.08.04

소스코드 

int leftSum = 0;
int rightSum = 0;

int min = 0;

// 2. 한칸씩 이동하며 leftSum 과 차이 계산
for(int p = 0 ; p < A.length ; p ++){

	// 초기화
	if(p == 0){
		leftSum = 0;
		for(int i = 0 ; i < A.length ; i ++){
			rightSum += A[i];
		}
	}
	else if(p == 1){
		leftSum = A[0];
		rightSum = rightSum - A[0];
		min = Math.abs(rightSum - leftSum);
	}
	else {
		leftSum = leftSum+A[p-1];
		rightSum = rightSum - A[p-1];
		if(min > Math.abs(rightSum-leftSum)){
			min = Math.abs(rightSum-leftSum);
		}
	}
}
return min;

'공부-codility' 카테고리의 다른 글

[Lesson] 4. PermCheck  (0) 2022.08.08
[Lesson] 4. FrogRiverOne  (0) 2022.08.08
[Lesson] 3. PermMissionElem  (0) 2022.08.04
[Lesson] 3. FrogJmp  (0) 2022.08.04
[Lesson] 2. Arrays - OddOccurrencesInArray  (0) 2022.08.04

+ Recent posts

티스토리툴바