Update
This commit is contained in:
@@ -13,18 +13,21 @@
|
||||
给你一个按 非递减顺序 排序的整数数组 nums,返回 每个数字的平方 组成的新数组,要求也按 非递减顺序 排序。
|
||||
|
||||
示例 1:
|
||||
输入:nums = [-4,-1,0,3,10]
|
||||
输出:[0,1,9,16,100]
|
||||
解释:平方后,数组变为 [16,1,0,9,100],排序后,数组变为 [0,1,9,16,100]
|
||||
* 输入:nums = [-4,-1,0,3,10]
|
||||
* 输出:[0,1,9,16,100]
|
||||
* 解释:平方后,数组变为 [16,1,0,9,100],排序后,数组变为 [0,1,9,16,100]
|
||||
|
||||
示例 2:
|
||||
输入:nums = [-7,-3,2,3,11]
|
||||
输出:[4,9,9,49,121]
|
||||
* 输入:nums = [-7,-3,2,3,11]
|
||||
* 输出:[4,9,9,49,121]
|
||||
|
||||
# 算法公开课
|
||||
|
||||
**[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html):[双指针法经典题目!LeetCode:977.有序数组的平方](https://www.bilibili.com/video/BV1QB4y1D7ep),相信结合视频再看本篇题解,更有助于大家对本题的理解**。
|
||||
|
||||
|
||||
# 思路
|
||||
|
||||
针对本题,我录制了视频讲解:[双指针法经典题目!LeetCode:977.有序数组的平方](https://www.bilibili.com/video/BV1QB4y1D7ep),结合本题解一起看,事半功倍!
|
||||
|
||||
## 暴力排序
|
||||
|
||||
最直观的想法,莫过于:每个数平方之后,排个序,美滋滋,代码如下:
|
||||
|
||||
Reference in New Issue
Block a user