1. method override 상속하는 클래스에서 상위 클래스(또는 인터페이스)의 메서드를 재정의하는 것 메서드를 재정의 하는 것이기 때문에 final, static 메서드는 오버라이드 할 수 없습니다. protected 이상의 접근 제한자에서 지원됩니다. private 접근제한자는 오버라이드 할 수 없습니다. 서브 클래스의 오버라이드 메서드에서 슈퍼 클래스의 메서드를 호출하고 싶다면 super키워드를 사용하면 됩니다. 오버라이딩은 런타임 시 실질적으로 작동될 메서드가 결정되는 동적 바인딩 방식입니다. 1.1. 예제 1 Java에서 서브 클래스 타입은 슈퍼 클래스 타입으로 받을 수 있습니다. 아래 예제에서는 Animal 타입으로 Cat, Dog 클래스를 받을 수 있습니다. interface Anima..

MinAvgTwoSlice A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P < Q < N, is called a slice of array A (notice that the slice contains at least two elements). The average of a slice (P, Q) is the sum of A[P] + A[P + 1] + ... + A[Q] divided by the length of the slice. To be precise, the average equals (A[P] + A[P + 1] + ... + A[Q]) / (Q − P + 1). Fo..

FrogRiverOne Find the earliest time when a frog can jump to the other side of a river. A small frog wants to get to the other side of a river. The frog is initially located on one bank of the river (position 0) and wants to get to the opposite bank (position X+1). Leaves fall from a tree onto the surface of the river. You are given an array A consisting of N integers representing the falling lea..

PermMissingElem Find the missing element in a given permutation. An array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing. Your goal is to find that missing element. Write a function: class Solution { public int solution(int[] A); } that, given an array A, returns the value of the missing elemen..

FrogJmp Count minimal number of jumps from position X to Y. A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D. Count the minimal number of jumps that the small frog must perform to reach its target. Write a function: class Solution { public..

OddOccurrencesInArray Find value that occurs in odd number of elements. A non-empty array A consisting of N integers is given. The array contains an odd number of elements, and each element of the array can be paired with another element that has the same value, except for one element that is left unpaired. For example, in array A such that: A[0] = 9 A[1] = 3 A[2] = 9 A[3] = 3 A[4] = 9 A[5] = 7 ..