물빠진떡 님의 블로그

문제Given a string word, compress it using the following algorithm:Begin with an empty string comp. While word is not empty, use the following operation:Remove a maximum length prefix of word made of a single character c repeating at most 9 times.Append the length of the prefix followed by c to comp.Return the string comp.요약연속된 문자가 몇개있는지 세되 9개 씩만풀이어렵진않다 우선 첫글자를 저장해두고 다음 문자가 같은지 비교후 다르거나 9를 넘는다면 sb..

문제Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s.A shift on s consists of moving the leftmost character of s to the rightmost position.For example, if s = "abcde", then it will be "bcdea" after one shift.요약첫글자를 마지막으로 돌리면서 goal과 같은게 나오는지 검사풀이처음에는 String.substring으로 풀긴했는데 효율이 너무 안좋게 나오길레그냥 s 문자 안바꾸고 idx로 검하였다.코드class Solution { public..

문제A sentence is a list of words that are separated by a single space with no leading or trailing spaces.For example, "Hello World", "HELLO", "hello world hello world" are all sentences.Words consist of only uppercase and lowercase English letters. Uppercase and lowercase English letters are considered different.A sentence is circular if:The last character of a word is equal to the first characte..

문제A fancy string is a string where no three consecutive characters are equal.Given a string s, delete the minimum possible number of characters from s to make it fancy.Return the final string after the deletion. It can be shown that the answer will always be unique.요약String에서 연속으로 같은 char 3개가 나오지않게 제거풀이char를 하나씩 조회하면서 counting 하며 3개 이상이 되면 무시, 다른 글자가 나올 경우 count를 초기화하고 진행코드class Solution { pu..

문제Given a list of folders folder, return the folders after removing all sub-folders in those folders. You may return the answer in any order.If a folder[i] is located within another folder[j], it is called a sub-folder of it. A sub-folder of folder[j] must start with folder[j], followed by a "/". For example, "/a/b" is a sub-folder of "/a", but "/b" is not a sub-folder of "/a/b/c".The format of ..