Java449 [LeetCode/Java] N-th Tribonacci Number -Codeclass Solution { public int tribonacci(int n) { int[] dp = new int[38]; dp[1] = 1; dp[2] = 1; for (int i = 3; i 2025. 12. 31. [백준/Java] 3018번 캠프파이어 -Codeimport java.util.*;import java.io.*;public class BOJ3018 { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int e = Integer.parseInt(br.readLine()); // 결과 저장할 배열 선언 List> answer = new ArrayList(); for (int i =.. 2025. 12. 31. [LeetCode/Java] Guess Number Higher or Lower -Code/** * Forward declaration of guess API. * @param num your guess * @return -1 if num is higher than the picked number * 1 if num is lower than the picked number * otherwise return 0 * int guess(int num); */public class Solution extends GuessGame { public int guessNumber(int n) { long left = 1, right = n; while(left 처음에 api를 이용해야 하는 문제임.. 2025. 12. 31. [LeetCode/Java] Search in a Binary Search Tree -Code/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */class Solution { public TreeNode searchBST(Tre.. 2025. 12. 31. [LeetCode/Java] Leaf-Similar Trees -Code/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */class Solution { public boolean leafSimilar(Tr.. 2025. 12. 31. [LeetCode/Java] Maximum Depth of Binary Tree -Code/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */class Solution { public int maxDepth(TreeNode .. 2025. 12. 31. 이전 1 ··· 25 26 27 28 29 30 31 ··· 75 다음