얼렁뚱땅 개발 블로그

문제You are given an integer array nums consisting of 2 * n integers. You need to divide nums into n pairs such that:Each element belongs to exactly one pair.The elements present in a pair are equal. Return true if nums can be divided into n pairs, otherwise return false. Constraints:nums.length == 2 * n1 1 해석nums는 2 * n개의 정수로 구성된 정수 배열이 주어집니다. nums를 다음과 같은 조건을 만족하는 n개의 쌍으로 나누어야 합니다:각 요소는 정확히 하나의 ..

문제You are given a string s that consists of lowercase English letters. A string is called special if it is made up of only a single character. For example, the string "abc" is not special, whereas the strings "ddd", "zz", and "f" are special. Return the length of the longest special substring of s which occurs at least thrice, or -1 if no special substring occurs at least thrice. A substring is ..