## 題敘

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has enough space (size that is equal to m + n) to hold additional elements from nums2.

## 題敘

erge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.

## 題敘

Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

An input string is valid if:

1. Open brackets must be closed by the same type of brackets.
2. Open brackets must be closed in the correct order.

## 題敘

（這是電神海牛整理在zerojudge上的題敘，我寫的程式碼都是丟上去是有過的 -> 連結

## 題敘

（這是電神海牛整理在zerojudge上的題敘，我寫的程式碼都是丟上去是有過的 -> 連結

## 題敘

• 若 u=v，每單位流量需要花 1 塊錢。
• 若 u≠v，小於等於 1000 的流量每單位要 3 塊錢，大於 1000 的部份每單位 2 塊錢。

（這是電神海牛整理在zerojudge上的題敘，我寫的程式碼都是丟上去是有過的 -> 連結

## 題敘

（這是電神海牛整理在zerojudge上的題敘，我寫的程式碼都是丟上去是有過的 -> 連結

## 題敘

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

## 題敘

Given an integer n and an integer start.

Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length.

Return the bitwise XOR of all elements of nums.

## 題敘

Given two arrays of integers nums and index. Your task is to create target array under the following rules:

• Initially target array is empty.
• From left to right read nums[i] and index[i], insert at index index[i] the value nums[i] in target array.
• Repeat the previous step until there are no elements to read in nums and index.

Return the target array.

It is guaranteed that the insertion operations will be valid.