ARST打卡第279周

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

impl Solution {
    pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
        let n = nums.len();
        let mut result = vec![0; n];
        
        // 要注意特例，否则 Compile Error. 一发
        if n == 1 {
            return vec![nums[0] * nums[0]];
        }
        
        let mut left = 0;
        let mut right = n - 1;
        let mut index = n - 1;

        while left <= right {
            let left_square = nums[left] * nums[left];
            let right_square = nums[right] * nums[right];
            
            if left_square > right_square {
                result[index] = left_square;
                left += 1;
            } else {
                result[index] = right_square;
                right -= 1;
            }
            
            // 这里也能处理n=1的情况
            if index == 0 {
                break;
            }
            index -= 1;
        }

        result
    }
}