zoukankan      html  css  js  c++  java
  • leetcode 977 有序数组的平方

    package com.example.lettcode.dailyexercises;
    
    /**
     * @Class SortedSquares
     * @Description 977 有序数组的平方
     * @Author
     * @Date 2020/10/16
     **/
    public class SortedSquares {
        public static int[] sortedSquares(int[] A) {
            if (A.length == 0) return new int[]{};
            int indexZero = 0;
            // 需要考虑下标是否越界
            while (indexZero < A.length && A[indexZero] < 0) {
                ++indexZero;
            }
            int[] res = new int[A.length];
            int index = -1;
            int indexL = indexZero - 1;
            int indexR = indexZero;
            while (indexL >= 0 && indexR < A.length) {
                if (Math.abs(A[indexL]) < Math.abs(A[indexR])) {
                    res[++index] = A[indexL] * A[indexL];
                    indexL--;
                } else {
                    res[++index] = A[indexR] * A[indexR];
                    indexR++;
                }
            }
    
            while (indexL >= 0) {
                res[++index] = A[indexL] * A[indexL];
                indexL--;
            }
            while (indexR < A.length) {
                res[++index] = A[indexR] * A[indexR];
                indexR++;
            }
            return res;
        }
    
    
        public static void main(String[] args) {
            int[] A = new int[]{-7, -3, 2, 3, 11};
            int[] ans = sortedSquares(A);
            System.out.println("SortedSquares demo01 result:");
            for (int num : ans) {
                System.out.print("," + num);
            }
            System.out.println();
            A = new int[]{-4, -1, 0, 3, 10};
            ans = sortedSquares(A);
            System.out.println("SortedSquares demo02 result:");
            for (int num : ans) {
                System.out.print("," + num);
            }
            System.out.println();
            A = new int[]{-1};
            ans = sortedSquares(A);
            System.out.println("SortedSquares demo03 result:");
            for (int num : ans) {
                System.out.print("," + num);
            }
        }
    }
    
    
  • 相关阅读:
    派遣函数
    英文论文(1)
    状态机和时序图的“前世姻缘”
    线程安全性:原子性,安全性,加锁机制
    多线程程序中操作的原子性
    win10下安装Centos7总笔记!
    分支限界法---旅行售货员问题
    PHP+ajax聊天室源码!支持长轮循跟定时请求两种
    elasticsearch配置优化
    hbase region与内存的关系
  • 原文地址:https://www.cnblogs.com/fyusac/p/13829992.html
Copyright © 2011-2022 走看看