LeetCode 977 Squares of a Sorted Array 解题报告

题目要求

Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.

题目分析及思路

题目给出一个整数数组，已经按照非减顺序排列好了。要求返回一个数组，包含的元素是已知数组元素的平方，且按照非减顺序排列。可以使用列表的sort()函数进行排序。

python代码?

class Solution:

def sortedSquares(self, A):

"""

:type A: List[int]

:rtype: List[int]

"""

B = list()

for i in A:

B.append(i**2)

B.sort()

return B

原文地址：https://www.cnblogs.com/yao1996/p/10317962.html

时间： 2024-08-30 16:33:10

LeetCode 977 Squares of a Sorted Array 解题报告的相关文章

【LeetCode】Remove Duplicates from Sorted Array 解题报告

[LeetCode]Remove Duplicates from Sorted Array 解题报告标签(空格分隔): LeetCode [LeetCode] https://leetcode.com/problems/remove-duplicates-from-sorted-array/ Total Accepted: 129010 Total Submissions: 384622 Difficulty: Easy Question Given a sorted array, remov

LeetCode 977. Squares of a Sorted Array

977. Squares of a Sorted Array(有序数组的平方) 题目: 给定一个按非递减顺序排序的整数数组 A,返回每个数字的平方组成的新数组,要求也按非递减顺序排序. 示例 1: 输入:[-4,-1,0,3,10] 输出:[0,1,9,16,100] 示例 2: 输入:[-7,-3,2,3,11] 输出:[4,9,9,49,121] 提示: 1 <= A.length <= 10000 -10000 <= A[i] <= 10000 A 已按非递减顺序排序. 思路

【LeetCode】Search in Rotated Sorted Array 解题报告

[题目] Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found in the array return its index, otherwise return -1. You may assume no d

LeetCode 977. Squares of a Sorted Array (有序数组的平方)

题目标签:Array 题目给了我们一组从小到大的 integers,让我们平方数字并且也排序成从小到达. 因为有负数在里面,平方后,负数在array的位置会变动. 可以设left 和 right pointers,从两边遍历,比较一下两个平方后的数字,把大的那个放入新建的array的末尾. 具体看code. Java Solution: Runtime beats 100.00% 完成日期:02/03/2019 关键点:two pointers 1 class Solution 2 {

【Leetcode_easy】977. Squares of a Sorted Array

problem 977. Squares of a Sorted Array solution: class Solution { public: vector<int> sortedSquares(vector<int>& A) { for(auto &a:A) a *=a; sort(A.begin(), A.end()); return A; } }; 参考1. Leetcode_easy_977. Squares of a Sorted Array; 完原

LeetCode: Search in Rotated Sorted Array 解题报告

Search in Rotated Sorted Array Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found in the array return its index, otherwise retu

【LeetCode】Find Minimum in Rotated Sorted Array 解题报告

今天看到LeetCode OJ题目下方多了"Show Tags"功能.我觉着挺好,方便刚開始学习的人分类练习.同一时候也是解题时的思路提示. [题目] Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. You may assume no

[leetcode] 88. Merge Sorted Array 解题报告

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initi

Remove Duplicates from Sorted Array ——解题报告

[题目] Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory. For example, Given input array