moonscode

업데이트 :: 2018.08.23 문제코드결과문제Stacks and Queues > Brackets Determine whether a given string of parentheses (multiple types) is properly nested. 코드1차 풀이import java.util.*; class Solution { public int solution(String S) { if(S.equals("")) return 1; int count = 0; int flag = 0; // () 0, {} 1, [] 2 Stack stack = new Stack(); for(int i=0; i 0) { if(stack.pop() != 0) return 0; } else return 0; break; cas..

업데이트 :: 2018.08.23 문제코드결과문제Stacks and Queues > Nesting Determine whether a given string of parentheses (single type) is properly nested. 코드1차 풀이class Solution { public int solution(String S) { if(S.equals("")) return 1; int stack = 0; for(int i=0; i

업데이트 :: 2018.08.21 문제코드결과문제NumberOfDiscIntersections Compute the number of intersections in a sequence of discs. 코드1차 풀이class Solution { public int solution(int[] A) { // 디스크에 경계가 있음 // [1, 5, 2, 1, 4, 0] int pairs = 0; for(int i=0; i 10000000 ? -1 : pairs); } } 2차 풀이import java.util.*; class Solution { public int solution(int[] A) { // == 최소값 & 최대값 배열 == MyArr[] arr = new MyArr[A.length]; for(i..

업데이트 :: 2018.08.21 문제코드결과문제Determine whether a triangle can be built from a given set of edges. 코드1차 풀이class Solution { public int solution(int[] A) { // 삼각형을 만족하는 3개의 인자 // (P, Q, R) 0 ≤ P (10, 5, 8) // [규칙] 최대항이 나머지 2개의 항보다 작으면 삼각형 if(A.length

업데이트 :: 2018.08.21 문제코드결과문제Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R). 코드1차 풀이import java.util.*; class Solution { public int solution(int[] A) { // 3개의 요소의 곱이 가장 큰것 // (-)가 3개일때 => (-) // (-)가 2개일때 => (+) // (-)가 1개일때 => (-) // (-)가 0개일때 => (+) Arrays.sort(A); if(A[0] * A[1] > A[A.length-2] * A[A.length-1]) { return A[0] * A[1] * A[A.length-1]; } else { return A[A.length-3] * A[A.len..

업데이트 :: 2018.08.21 문제코드결과문제Compute number of distinct values in an array. 코드1차 풀이import java.util.*; class Solution { public int solution(int[] A) { // 중복제거 Set set = new HashSet(); for(int a : A) { set.add(a); } return set.size(); } } 결과1차 100%정확 : 100%성능 : 100%Created by MoonsCodinge-mail :: jm921106@gmail.com

업데이트 :: 2018.08.19 문제코드결과문제Find the minimal average of any slice containing at least two elements. 코드1차 풀이class Solution { public int solution(int[] A) { // (2

업데이트 :: 2018.08.19 문제코드결과학습문제A DNA sequence can be represented as a string consisting of the letters A, C, G and T, which correspond to the types of successive nucleotides in the sequence. Each nucleotide has an impact factor, which is an integer. Nucleotides of types A, C, G and T have impact factors of 1, 2, 3 and 4, respectively. You are going to answer several queries of the form: What is th..

업데이트 :: 2018.08.19 문제코드결과학습문제Write a function: class Solution { public int solution(int A, int B, int K); } that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.: { i : A ≤ i ≤ B, i mod K = 0 } For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the ran..

업데이트 :: 2018.08.19 문제코드결과문제A non-empty array A consisting of N integers is given. The consecutive elements of array A represent consecutive cars on a road. Array A contains only 0s and/or 1s: 0 represents a car traveling east, 1 represents a car traveling west. The goal is to count passing cars. We say that a pair of cars (P, Q), where 0 ≤ P < Q < N, is passing when P is traveling to the east an..