【Leetcode】 第387场周赛 — 题解

2024-03-05 1883阅读

温馨提示:这篇文章已超过384天没有更新,请注意相关的内容是否还可用!

3069. Distribute Elements Into Two Arrays I

You are given a 1-indexed array of distinct integers nums of length n.

You need to distribute all the elements of nums between two arrays arr1 and arr2 using n operations. In the first operation, append nums[1] to arr1. In the second operation, append nums[2] to arr2. Afterwards, in the ith operation:

If the last element of arr1 is greater than the last element of arr2, append nums[i] to arr1. Otherwise, append nums[i] to arr2.

The array result is formed by concatenating the arrays arr1 and arr2. For example, if arr1 == [1,2,3] and arr2 == [4,5,6], then result = [1,2,3,4,5,6].

Return the array result.

Example 1:

Input: nums = [2,1,3]

Output: [2,3,1]

Explanation: After the first 2 operations, arr1 = [2] and arr2 = [1].

In the 3rd operation, as the last element of arr1 is greater than the last element of arr2 (2 > 1), append nums[3] to arr1.

After 3 operations, arr1 = [2,3] and arr2 =[1].

Hence, the array result formed by concatenation is [2,3,1].

Example 2:

Input: nums = [5,4,3,8]

Output: [5,3,4,8]

Explanation: After the first 2 operations, arr1 = [5] and arr2 = [4].

In the 3rd operation, as the last element of arr1 is greater than the last element of arr2 (5 > 4), append nums[3] to arr1, hence arr1 becomes [5,3].

In the 4th operation, as the last element of arr2 is greater than the last element of arr1 (4 > 3), append nums[4] to arr2, hence arr2 becomes [4,8].

After 4 operations, arr1 = [5,3] and arr2 = [4,8].

Hence, the array result formed by concatenation is [5,3,4,8].

Constraints:

  • 3 public: vector vector if (arr1.back() arr2.back()) { arr1.push_back(nums[i]); } else { arr2.push_back(nums[i]); } } vector public: vector vectornums[0]}, b{nums[1]}; for (int i = 2; i
VPS购买请点击我

免责声明:我们致力于保护作者版权,注重分享,被刊用文章因无法核实真实出处,未能及时与作者取得联系,或有版权异议的,请联系管理员,我们会立即处理! 部分文章是来自自研大数据AI进行生成,内容摘自(百度百科,百度知道,头条百科,中国民法典,刑法,牛津词典,新华词典,汉语词典,国家院校,科普平台)等数据,内容仅供学习参考,不准确地方联系删除处理! 图片声明:本站部分配图来自人工智能系统AI生成,觅知网授权图片,PxHere摄影无版权图库和百度,360,搜狗等多加搜索引擎自动关键词搜索配图,如有侵权的图片,请第一时间联系我们,邮箱:ciyunidc@ciyunshuju.com。本站只作为美观性配图使用,无任何非法侵犯第三方意图,一切解释权归图片著作权方,本站不承担任何责任。如有恶意碰瓷者,必当奉陪到底严惩不贷!

目录[+]