# LeetCode 1929
###### tags: `python`,`LeetCode`
>這邊使用Python解題
## 題目：
Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed).

Specifically, ans is the concatenation of two nums arrays.

Return the array ans.

## 範例
### 範例 1:

Input: nums = [1,2,1]
Output: [1,2,1,1,2,1]
Explanation: The array ans is formed as follows:
- ans = [nums[0],nums[1],nums[2],nums[0],nums[1],nums[2]]
- ans = [1,2,1,1,2,1]

### 範例 2:

Input: nums = [1,3,2,1]
Output: [1,3,2,1,1,3,2,1]
Explanation: The array ans is formed as follows:
- ans = [nums[0],nums[1],nums[2],nums[3],nums[0],nums[1],nums[2],nums[3]]
- ans = [1,3,2,1,1,3,2,1]

## 條件限制
* n == nums.length
* 1 <= n <= 1000
* 1 <= nums[i] <= 1000

## 我的解題思路：
其實題目蠻簡單的，就只是做陣列的擴張，也不需要去寫什麼，直接把陣列*2就好XD

## 程式碼:

def getConcatenation(nums):
    return 2*nums

## 測試
這要寫什麼測試 = =