add PROGRAMMERS-154539

Author: codejsha

README.md

@@ -54,3 +54,4 @@
 | PROGRAMMERS-131127        | [java](programmers/problem131127)  | [할인 행사 (Discount Events)](https://school.programmers.co.kr/learn/courses/30/lessons/131127)                                       |
 | PROGRAMMERS-131701 :star: | [java](programmers/problem131701)  | [연속 부분 수열 합의 개수 (Number of Consecutive Subsequence Sums)](https://school.programmers.co.kr/learn/courses/30/lessons/131701) |
 | PROGRAMMERS-138476        | [c++](programmers/problem138476)   | [귤 고르기 (Picking Tangerines)](https://school.programmers.co.kr/learn/courses/30/lessons/138476)                                    |
+| PROGRAMMERS-154539        | [java](programmers/problem154539)  | [뒤에 있는 큰 수 찾기 (Find the Larger Number Behind)](https://school.programmers.co.kr/learn/courses/30/lessons/154539)              |

programmers/problem154539/FindLargerNumberBehind.java

@@ -0,0 +1,29 @@
+package problem154539;
+
+import java.util.Arrays;
+import java.util.Stack;
+
+public class FindLargerNumberBehind {
+    public static void main(final String[] args) {
+        final var sol = new FindLargerNumberBehind();
+        final var numbers = new int[]{9, 1, 5, 3, 6, 2};
+        final var expected = new int[]{-1, 5, 6, 6, -1, -1};
+        final var result = sol.solution(numbers);
+        System.out.println("expected: " + Arrays.toString(expected) + " result: " + Arrays.toString(result));
+    }
+
+    public int[] solution(final int[] numbers) {
+        final var result = new int[numbers.length];
+        Arrays.fill(result, -1);
+        final var stack = new Stack<Integer>();
+
+        for (var i = 0; i < numbers.length; i++) {
+            while (!stack.isEmpty() && numbers[stack.peek()] < numbers[i]) {
+                result[stack.pop()] = numbers[i];
+            }
+            stack.push(i);
+        }
+
+        return result;
+    }
+}