T1: leetcode.912 排序数组
解法一:
class Solution {
public:
vector<int> sortArray(vector<int>& nums) {
sort(nums.begin(), nums.end());
return nums;
}
};
//开个玩笑,虽然过了肯定不能这么做
T2:leetcode.88 合并两个有序数组
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for (int i = m; i < m + n; i++) {
nums1[i] = nums2[i-m];
}
sort(nums1.begin(), nums1.end());
}
};