LeetCode --- 977. Squares of a Sorted Array 解题报告

杨鑫newlfe

于 2021-08-08 11:36:08 发布

阅读量291

点赞数

分类专栏： Python 算法 LeetCode 文章标签： LeetCode Python 算法面试

本文链接：https://blog.youkuaiyun.com/u012965373/article/details/119512448

版权

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

这篇博客分享了如何解决LeetCode上的977题，即给定非递减有序整数数组，返回每个数的平方后的非递减有序数组。博主探讨了直接平方并排序的简单方法，并提出寻求更高效解决方案的挑战。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.

Example 1:

Input: nums = [-4,-1,0,3,10]
Output: [0,1,9,16,100]
Explanation: After squaring, the array becomes [16,1,0,9,100].
After sorting, it becomes [0,1,9,16,100].

Example 2:

Input: nums = [-7,-3,2,3,11]
Output: [4,9,9,49,121]

Constraints:

1 <= nums.length <= 104
-104 <= nums[i] <= 104
nums

了解本专栏