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: or . The first path takes jumps while the second takes .
Function Description
Complete the jumpingOnClouds function in the editor below. It should return the minimum number of jumps required, as an integer.
jumpingOnClouds has the following parameter(s):
- c: an array of binary integers
Input Format
The first line contains an integer , the total number of clouds. The second line contains space-separated binary integers describing clouds where .
Constraints
Output Format
Print the minimum number of jumps needed to win the game.
Sample Input 0
7
0 0 1 0 0 1 0
Sample Output 0
4
Explanation 0:
Emma must avoid and . She can win the game with a minimum of jumps:
Emma must avoid and . She can win the game with a minimum of jumps:

Sample Input 1
6
0 0 0 0 1 0
Sample Output 1
3
Explanation 1:
The only thundercloud to avoid is . Emma can win the game in jumps:
The only thundercloud to avoid is . Emma can win the game in jumps:

문제 요약 : 첫 번째 라인에 배열의 길이, 두 번째 라인에 배열이 주어진다.
배열은 0, 1 로만 구성 되어 있다.
0은 점프해서 갈 수 있는곳,
1은 점프해서 갈 수 없는 곳이다.
출발은 배열의 0 번 째 인덱스이다.
점프가능 거리는 1, 2.
도착은 배열의 마지막 인덱스이다.
출발에서 도착까지 최소 점프 횟수를 구하는 문제이다.
접근 방법 : 백준에서 지난 번에 풀었던, 퇴사 문제와 비슷한 유형이라고 생각했다. 재귀로 풀면 좋을 것 같다고 생각이 되었다. 1, 2 두번 다 점프를 해본다. 점프한 곳이 thunderheads이면 즉 값이 1이면 return 해버린다.
아닐 경우 도착할 때 까지 계속해서 1, 2 점프를 진행 한다.
댓글
댓글 쓰기