개발잡부

An array A consisting of N integers is given. The dominator of array A is the value that occurs in more than half of the elements of A. For example, consider array A such that A[0] = 3 A[1] = 4 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = -1 A[6] = 3 A[7] = 3 The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7) and 5 is more than a half of 8...

package programers; import java.util.Arrays; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.Stack; import java.util.TreeMap; import java.util.stream.Collectors; public class Kakao5chunsung { // // // 실패율은 다음과 같이 정의한다. // 스테이지에 도달했으나 아직 클리어하지 못한 플레이어의 수 / 스테이지에 도달한 플레이어 수 // 전체 스테이지의 개수 N, 게임을 이용하는 사용자가 현재 멈춰있는 스테이지의 번호가 담긴 배열 ..

public static int[] findTwoSum(int[] list, int sum) { Map integerMap = new HashMap(); System.out.println("sum: " + sum); if (list == null || list.length < 2) return null; for (int i = 0; i < list.length; i++) { int ch = sum - list[i]; if( integerMap.containsKey(ch)){ return new int[]{i, integerMap.get(ch)}; } else { integerMap.put(list[i], i); } } return null; }

맵리듀스 세이프모드 # 세이프 모드 상태 확인 $ hdfs dfsadmin -safemode get Safe mode is OFF # 세이프 모드 진입 $ hdfs dfsadmin -safemode enter Safe mode is ON # 세이프 모드 해제 $ hdfs dfsadmin -safemode leave Safe mode is OFF 데이터블록 The filesystem under path '/user/hadoop' is CORRUPT # 커럽트 상태의 파일 삭제 $ hdfs fsck -delete # /user/hadoop/ 의 복제 개수를 5로 조정 $ hadoop fs -setrep 5 /user/hadoop/ # /user/hadoop/ 하위의 모든 파일의 복제 개수를 조정 $ hado..

A string S consisting of N characters is called properly nested if: S is empty; S has the form "(U)" where U is a properly nested string; S has the form "VW" where V and W are properly nested strings. For example, string "(()(())())" is properly nested but string "())" isn't. Write a function: class Solution { public int solution(String S); } that, given a string S consisting of N characters, re..

You are given two non-empty arrays A and B consisting of N integers. Arrays A and B represent N voracious fish in a river, ordered downstream along the flow of the river. The fish are numbered from 0 to N − 1. If P and Q are two fish and P < Q, then fish P is initially upstream of fish Q. Initially, each fish has a unique position. Fish number P is represented by A[P] and B[P]. Array A contains ..

A string S consisting of N characters is considered to be properly nested if any of the following conditions is true: S is empty; S has the form "(U)" or "[U]" or "{U}" where U is a properly nested string; S has the form "VW" where V and W are properly nested strings. For example, the string "{[()()]}" is properly nested but "([)()]" is not. Write a function: class Solution { public int solution..

public static int solution(int[] A) { // write your code in Java SE 8 int N = A.length; long[] lower = new long[N]; long[] upper = new long[N]; for (int i = 0; i = lower[j]) { intersection += j; inte..

An array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 ≤ P A[R], A[Q] + A[R] > A[P], A[R] + A[P] > A[Q]. For example, consider array A such that: A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20 Triplet (0, 2, 4) is triangular. Write a function: class Solution { public int solution(int[] A); } that, given an array A consisting o..

A non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P < Q < R < N). For example, array A such that: A[0] = -3 A[1] = 1 A[2] = 2 A[3] = -2 A[4] = 5 A[5] = 6 contains the following example triplets: (0, 1, 2), product is −3 * 1 * 2 = −6 (1, 2, 4), product is 1 * 2 * 5 = 10 (2, 4, 5), product is 2 * 5 * 6 = 60 Your goal is to fi..