题目如下:
- 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.
- Example 1:
- Input: [-4,-1,0,3,10]
- Output: [0,1,9,16,100]
- Example 2:
- Input: [-7,-3,2,3,11]
- Output: [4,9,9,49,121]
- Note:
- 1 <= A.length <= 10000
- -10000 <= A[i] <= 10000
A is sorted in non-decreasing order.
解题思路: 在 leetcode, 还有比这更简单的题目吗?
闲聊: 最近在出差, 都没有时间刷题. 今天刷个容易的题保持手感吧.
代码如下:
- class Solution(object):
- def sortedSquares(self, A):
- """
- :type A: List[int]
- :rtype: List[int]
- """
- def f(x):
- return x*x
- return sorted(map(f,A))
来源: http://www.bubuko.com/infodetail-2927813.html