개발에 AtoZ까지

1. 문제 You are given a license key represented as a string S which consists only alphanumeric character and dashes. The string is separated into N+1 groups by N dashes. Given a number K, we would want to reformat the strings such that each group contains exactly K characters, except for the first group which could be shorter than K, but still must contain at least one character. Furthermore, ther..

1. 문제 Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), find the minimum number of conference rooms required. Input: [[0,30],[5,10],[15,20]] Output: 2 Input: [[7,10],[2,4]] Output: 1 2. 문제해설 회의실 사용 시간이 Input으로 주어졌을 때 회의실이 몇 개 필요한지 개수를 구하라 3. 코드 포맷 public class MeetingRoom2 { public static void main(String[] args) { MeetingRoom2 a = new Me..

1. 문제 Given a collection of intervals, merge all overlapping intervals. Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] 2. 문제해설 겹치는 부분을 통합하여라(ex, Input: [1,3],[2,6], Output:[1,6]) 3. 코드포맷 class Interval { int start; int end; Interval() { this.start = 0; this.end = 0; } Interval(int s, int e) { this.start = s; this.end = e; } @Override public String toString() { return start + ..