본문 바로가기

코테31

[Algorithm][개념 정리] Binary Tree Traveral - InOrder, PreOrder, PostOrder TreeNode 예제 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; } } InOrder 조회 순서 왼쪽 -> 자신 -> 오른쪽 private void treeNodeTraversal(TreeNode node) { treeNodeTraversal(node.left); System.out.println(node.val); treeNodeTraversal(node... 2022. 9. 30.
[Algorithm][프로그래머스] - 오픈채팅방 문제 링크 https://school.programmers.co.kr/learn/courses/30/lessons/42888?language=java 내 풀이 import java.lang.*; import java.util.*; class Solution { public String[] solution(String[] record) { List answer = new ArrayList(); Map map = new HashMap(); for(String r : record) { String[] log = r.split(" "); String type = log[0]; String uId = log[1]; String oId = log.length == 2 ? "" : log[2]; if(!type.eq.. 2022. 9. 5.
[Algorithm][Graph][Java] 문제 풀이 #29 - 542. 01 Matrix 문제 링크 https://leetcode.com/problems/01-matrix/ 문제 풀이 public int[][] updateMatrix(int[][] mat) { int row = mat.length; int col = mat[0].length; for (int i = 0; i 0) mat[i][j] = Math.min(mat[i][j], mat[i - 1][j] + 1); if (j > 0) mat[i][j] = Math.min(mat[i][j], mat[i][j - 1] + 1); } } for (int.. 2022. 8. 31.
[Algorithm][Graph][Java] 문제 풀이 #28 - 733. Flood Fill 문제 링크 https://leetcode.com/problems/flood-fill/ 내 코드 int startPixel = 0; public int[][] floodFill(int[][] image, int sr, int sc, int color) { if(!isInArrayIndex(image, sr, sc)) return image; startPixel = image[sr][sc]; recursion(image, sr, sc, color); return image; } private void recursion(int[][] image, int sr, int sc, int color) { if(!isInArrayIndex(image, sr, sc)) return; else if(image[sr][sc.. 2022. 8. 29.

티스토리툴바