알고리즘/LeetCode (18) 썸네일형 리스트형 [LeetCode/100/Java]Same Tree [LeetCode/100/Java]Same Tree 풀이 /** * 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 isSameTree(TreeNode p, TreeNode q) { if(p.. [LeetCode/98/Java]Validate Binary Search Tree [LeetCode/98/Java]Validate Binary Search Tree 풀이 /** * 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 isValidBST(TreeNode root.. [LeetCode/94/Java]Binary Tree Inorder Traversal [LeetCode/94/Java]Binary Tree Inorder Traversal 풀이 /** * 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 List inorderTraversal(TreeNode.. [LeetCode/21/Java]Merge Two Sorted Lists [LeetCode/21/Java]Merge Two Sorted Lists 풀이 /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next; } * } */ class Solution { public ListNode mergeTwoLists(ListNode list1, ListNode list2) { if(list1 == null && list2 == null) return .. [LeetCode/70/Java]Climbing Stairs [LeetCode/70/Java]Climbing Stairs 풀이 class Solution { public static int[] buf = new int[46]; public int climbStairs(int n) { if (n [LeetCode/119/Java]Pascal's Triangle II [LeetCode/119/Java]Pascal's Triangle II 풀이 class Solution { public static Map buf = new HashMap(); public static int maxRow = 0; public List getRow(int rowIndex) { List prev = null; List result = new ArrayList(); int start = maxRow; if(buf.containsKey(rowIndex)) return buf.get(rowIndex); result.add(1); for (int i = start; i 0) { if(i > 1) result.add(i); if(buf.containsKey(i)) { result = buf.get(.. [LeetCode/700/Java]Search in a Binary Search Tree [LeetCode/700/Java]Search in a Binary Search Tree 풀이 /** * 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(TreeNode .. [LeetCode/206/Java]Reverse Linked List [LeetCode/206/Java]Reverse Linked List 풀이 /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ListNode(int val) { this.val = val; } * ListNode(int val, ListNode next) { this.val = val; this.next = next; } * } */ class Solution { public ListNode reverseList(ListNode head) { if((head == null) || (head.next == null)) return head; ListNode.. 이전 1 2 3 다음
