There is an integer array nums that consists of n unique elements, but you have forgotten it. However, you do remember every pair of adjacent elements in nums.
You are given a 2D integer array adjacentPairs of size n - 1 where each adjacentPairs[i] = [ui, vi] indicates that the elements ui and vi are adjacent in nums.
It is guaranteed that every adjacent pair of elements nums[i] and nums[i+1] will exist in adjacentPairs, either as [nums[i], nums[i+1]] or [nums[i+1], nums[i]]. The pairs can appear in any order.
Return the original array nums. If there are multiple solutions, return any of them.
Given an array of integers nums, return the number of good pairs.
A pair (i, j) is called good if nums[i] == nums[j] and i < j.
Given an integer n, break it into the sum of k positive integers, where k >= 2, and maximize the product of those integers.
Return the maximum product you can get.
Given a string s, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.
Given a string s, rearrange the characters of s so that any two adjacent characters are not the same.
Return any possible rearrangement of s or return "" if not possible.
이 글의 코드 및 정보들은 강의 내용을 바탕으로 작성하였습니다.
커넥터는 태스크들을 관린한다.
태스트가 실질적인 데이터 처리를 담당한다.
커넥트안에 커넥터가 존재한다.
커넥트가 프로세스로 실행되는데 소스 커넥터를 1개 쓰레드로 실행