zoukankan      html  css  js  c++  java
  • [LeetCode] 977. Squares of a Sorted Array

    Description

    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. 1 <= A.length <= 10000
    2. -10000 <= A[i] <= 10000
    3. A is sorted in non-decreasing order.

    Analyse

    输入一个非递减的序列,输出这个序列的平方的非递减排序

    主要考虑之前的负数平方后会使排序改变,先将整个序列求绝对值再排序,然后输出序列的平方

    vector<int> sortedSquares(vector<int>& A) {
        for(int i = 0; i < A.size(); i++)
        {
            A[i] = abs(A[i]);
        }
    
        sort(A.begin(), A.end());
    
        for(int i = 0; i < A.size(); i++)
        {
            A[i] = A[i] * A[i] ;
        }
        return A;
    }
    
  • 相关阅读:
    1869六度分离
    1162Eddy's picture
    hdu2544
    3549Flow Problem
    1272小希的迷宫
    2112HDU Today(Dijkstra)
    1878欧拉回路
    hdu1116Play on Words
    2112HDU Today(SPFA)
    在程序中动态创建视图
  • 原文地址:https://www.cnblogs.com/arcsinw/p/10299356.html
Copyright © 2011-2022 走看看