kirinmanDevBlog

[문제 링크] https://www.hackerrank.com/challenges/countingsort1/problem?isFullScreen=true Counting Sort 1 | HackerRank Count the number of times each value appears. www.hackerrank.com public class CountingSort1 { public static void main(String[] args) { List arr = Arrays.asList(1, 1, 3, 2, 1); counting(arr); } public static List counting(List arr) { int[] answer = new int[100]; for (int i = 0; i < 1..

[문제 링크] https://www.hackerrank.com/challenges/correctness-invariant/problem package hackerRank; import java.util.Scanner; public class CorrectnessAndTheLoopInvariant { public static void main(String[] args) { Scanner in = new Scanner(System.in); //사용자로부터 값을 입력받는 스캐너 쓸거다 int numElements = in.nextInt(); //문제의 조건임. 처음에는 배열의 크기를 입력받음 int[] array = new int[numElements]; // 입력받은 크기를 사용해서 문제풀이에 사용할 배열 ..