자료구조 직접 구현 해보기3 - LinkedList ( Feat. Java)

이미지
이번에는, LinkedList를 직접 구현해 보았다. 역시 ForEach문을 사용할 수 있도록 Iterable 인터페이스를 상속받았다. add, 특정위치 add, addFirst, addLast, remove, 특정위치 remove, 같은 오브젝트 전체 remove, removeFirst, removeLast, get, size, clear 의 기능들을 구현해보았다. index 값과 size에 따라 NagativeArraySizeException, IndexOutOfBoundsException, NoSuchElementException 을 던지도록 구현했다.

HackerRank Java Repeated String

이미지
문제 풀기 :  https://www.hackerrank.com/challenges/repeated-string/problem?h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=warmup Lilah has a string,   , of lowercase English letters that she repeated infinitely many times. Given an integer,   , find and print the number of letter   a 's in the first     letters of Lilah's infinite string. For example, if the string     and   , the substring we consider is   , the first     characters of her infinite string. There are     occurrences of   a   in the substring.   Function Description Complete the   repeatedString   function in the editor below. It should return an integer representing the number of occurrences of   a   in the prefix of length     in the infinitely repeating string.   repeatedString has the following parameter(s):   s : a string to repeat ...

HackerRank Java Jumping On The Cloud

이미지
문제 풀기 :   https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem?h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=warmup Emma is playing a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. She can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus     or   . She must avoid the thunderheads. Determine the minimum number of jumps it will take Emma to jump from her starting postion to the last cloud. It is always possible to win the game.   For each game, Emma will get an array of clouds numbered     if they are safe or     if they must be avoided. For example,     indexed from   . The number on each cloud is its index in the list so she must avoid the clouds at indexes     and   . She could follow the following two paths:    ...