블루베리의 블로그

[알고리즘] LeetCode 1255 - Maximum Score Words Formed by Letters (C++)

[문제 링크] : https://leetcode.com/problems/maximum-score-words-formed-by-letters/description/ Maximum Score Words Formed by Letters - LeetCodeCan you solve this real interview question? Maximum Score Words Formed by Letters - Given a list of words, list of single letters (might be repeating) and score of every character. Return the maximum score of any valid set of words formed by using theleetcod..

[알고리즘] LeetCode 980 - Unique Paths III (C++)

[문제 링크] : https://leetcode.com/problems/unique-paths-iii/description/ Unique Paths III - LeetCodeCan you solve this real interview question? Unique Paths III - You are given an m x n integer array grid where grid[i][j] could be: * 1 representing the starting square. There is exactly one starting square. * 2 representing the ending square. There is exaleetcode.com#include using namespace std;clas..

[알고리즘] LeetCode 1028 - Recover a Tree From Preorder Traversal (C++)

[문제 링크] : https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/description/ Recover a Tree From Preorder Traversal - LeetCodeCan you solve this real interview question? Recover a Tree From Preorder Traversal - We run a preorder depth-first search (DFS) on the root of a binary tree. At each node in this traversal, we output D dashes (where D is the depth of this node), then weleet..

[문제 링크] : https://school.programmers.co.kr/learn/courses/30/lessons/214295 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krimport java.util.*;class Solution { static final long MASK = (1L uHigh || vLow > vHigh) { return 0; } baseVLow = -((long)m); baseVHigh = n; int maxNo = tests.length; long[] rectVL = new long[maxN..

[문제 링크] : https://school.programmers.co.kr/learn/courses/30/lessons/87394 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krimport java.util.*;class Solution { int q; int n; long[][] comb; long[][] pow; public int solution(int q, int[] a) { this.q = q; this.n = a.length; buildComb(); buildPow(); TreeSet set = new TreeS..

[문제 링크] : https://school.programmers.co.kr/learn/courses/30/lessons/1841 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krimport java.util.*;class Solution { public int solution(int n, int[][] triangle, int[][] v) { if(n == 0) { return 1; } if(n == 1) { return 3; } long[][] t = new long[3][2]; for(int..

[문제 링크] : https://school.programmers.co.kr/learn/courses/30/lessons/77887 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krimport java.util.*;class Solution { static int n; static int[] head; static int[] to; static int[] next; static int edges; static int[] parent; static int[] subtreeSize; static int[] heavy; static int[] chainHead; st..

[문제 링크] : https://school.programmers.co.kr/learn/courses/30/lessons/389632 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krimport java.util.*;class Solution { static class Node { int[] pos; int[] lazy; Node(int[] pos, int initialToken) { this.pos = pos; if(pos.length > 0) { lazy = new int[pos.length * 4 + ..

[문제 링크] : https://school.programmers.co.kr/learn/courses/30/lessons/389631 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krimport java.util.*;class Solution { static final int[] dy = {1, 0, -1, 0}; static final int[] dx = {0, 1, 0, -1}; public long solution(String[] grid) { int n = grid.length; int m = grid[0].length(); int size = n * m..

[문제 링크] : https://school.programmers.co.kr/learn/courses/30/lessons/76504 프로그래머스SW개발자를 위한 평가, 교육의 Total Solution을 제공하는 개발자 성장을 위한 베이스캠프programmers.co.krimport java.util.*;class Solution { public long[] solution(int n, int z, int[][] roads, long[] queries) { int limit = z * z; int[][] dp = new int[n][limit + 1]; int[] best = new int[limit + 1]; for(int i = 0; i