FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2307,3  "name": "replace-non-coprime-numbers-in-array",4  "difficulty": "Hard",5  "link": "https://leetcode.com/problems/replace-non-coprime-numbers-in-array/",6  "date": "2022-02-27",7  "task_description": "You are given an array of integers `nums`. Perform the following steps: Find **any** two **adjacent** numbers in `nums` that are **non-coprime**. If no such numbers are found, **stop** the process. Otherwise, delete the two numbers and **replace** them with their **LCM (Least Common Multiple)**. **Repeat** this process as long as you keep finding two adjacent non-coprime numbers. Return _the **final** modified array._ It can be shown that replacing adjacent non-coprime numbers in **any** arbitrary order will lead to the same result. The test cases are generated such that the values in the final array are **less than or equal** to `108`. Two values `x` and `y` are **non-coprime** if `GCD(x, y) > 1` where `GCD(x, y)` is the **Greatest Common Divisor** of `x` and `y`. **Example 1:** ``` **Input:** nums = [6,4,3,2,7,6,2] **Output:** [12,7,6] **Explanation:** - (6, 4) are non-coprime with LCM(6, 4) = 12. Now, nums = [**12**,3,2,7,6,2]. - (12, 3) are non-coprime with LCM(12, 3) = 12. Now, nums = [**12**,2,7,6,2]. - (12, 2) are non-coprime with LCM(12, 2) = 12. Now, nums = [**12**,7,6,2]. - (6, 2) are non-coprime with LCM(6, 2) = 6. Now, nums = [12,7,**6**]. There are no more adjacent non-coprime numbers in nums. Thus, the final modified array is [12,7,6]. Note that there are other ways to obtain the same resultant array. ``` **Example 2:** ``` **Input:** nums = [2,2,1,1,3,3,3] **Output:** [2,1,1,3] **Explanation:** - (3, 3) are non-coprime with LCM(3, 3) = 3. Now, nums = [2,2,1,1,**3**,3]. - (3, 3) are non-coprime with LCM(3, 3) = 3. Now, nums = [2,2,1,1,**3**]. - (2, 2) are non-coprime with LCM(2, 2) = 2. Now, nums = [**2**,1,1,3]. There are no more adjacent non-coprime numbers in nums. Thus, the final modified array is [2,1,1,3]. Note that there are other ways to obtain the same resultant array. ``` **Constraints:** `1 <= nums.length <= 105` `1 <= nums[i] <= 105` The test cases are generated such that the values in the final array are **less than or equal** to `108`.",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [6,4,3,2,7,6,2]",12      "output": "[12,7,6] "13    },14    {15      "label": "Example 2",16      "input": "nums = [2,2,1,1,3,3,3]",17      "output": "[2,1,1,3] "18    }19  ],20  "constraints": [21    "1 <= nums.length <= 105",22    "1 <= nums[i] <= 105",23    "The test cases are generated such that the values in the final array are less than or equal to 108."24  ],25  "python_template": "class Solution(object):\n    def replaceNonCoprimes(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: List[int]\n        \"\"\"\n        ",26  "java_template": "class Solution {\n    public List<Integer> replaceNonCoprimes(int[] nums) {\n        \n    }\n}",27  "metadata": {28    "func_name": "replaceNonCoprimes"29  }30}