Add rust implementation of squares of a sorted array

Author: thearyanahmed

README.md

@@ -161,7 +161,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0035 - Search Insert Position](https://leetcode.com/problems/search-insert-position/)</sub> | <sub><div align='center'>[✔️](c%2F0035-search-insert-position.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0035-search-insert-position.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0035-search-insert-position.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0035-search-insert-position.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0035-search-insert-position.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0035-search-insert-position.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0035-search-insert-position.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0035-search-insert-position.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0035-search-insert-position.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0035-search-insert-position.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0035-search-insert-position.ts)</div></sub>
 <sub>[0374 - Guess Number Higher Or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)</sub> | <sub><div align='center'>[✔️](c%2F0374-guess-number-higher-or-lower.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0374-guess-number-higher-or-lower.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0374-guess-number-higher-or-lower.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0374-guess-number-higher-or-lower.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0374-guess-number-higher-or-lower.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0374-guess-number-higher-or-lower.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0374-guess-number-higher-or-lower.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0374-guess-number-higher-or-lower.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0374-guess-number-higher-or-lower.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0441 - Arranging Coins](https://leetcode.com/problems/arranging-coins/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0441-arranging-coins.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0441-arranging-coins.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0441-arranging-coins.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0441-arranging-coins.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[0977 - Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0977-squares-of-a-sorted-array.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0977-squares-of-a-sorted-array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0977-squares-of-a-sorted-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0977-squares-of-a-sorted-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0977-squares-of-a-sorted-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0977-squares-of-a-sorted-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0977-squares-of-a-sorted-array.ts)</div></sub>
+<sub>[0977 - Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0977-squares-of-a-sorted-array.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0977-squares-of-a-sorted-array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0977-squares-of-a-sorted-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0977-squares-of-a-sorted-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0977-squares-of-a-sorted-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0977-squares-of-a-sorted-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust/0977-squares-of-a-sorted-array.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0977-squares-of-a-sorted-array.ts)</div></sub>
 <sub>[0367 - Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0367-valid-perfect-square.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0367-valid-perfect-square.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0367-valid-perfect-square.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0367-valid-perfect-square.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0367-valid-perfect-square.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0367-valid-perfect-square.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0069 - Sqrt(x) ](https://leetcode.com/problems/sqrtx/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0069-sqrtx.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0069-sqrtx.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0069-sqrtx.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0069-sqrtx.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0540 - Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0540-single-element-in-a-sorted-array.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0540-single-element-in-a-sorted-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0540-single-element-in-a-sorted-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0540-single-element-in-a-sorted-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0540-single-element-in-a-sorted-array.ts)</div></sub>

rust/0977-squares-of-a-sorted-array.rs

@@ -0,0 +1,29 @@
+impl Solution {
+    pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
+        let mut sq: Vec<i32> = vec![0; nums.len()];
+        let mut i = nums.len() as isize - 1;
+        let mut l = 0;
+        let mut r = nums.len() as isize - 1;
+        
+        while l <= r {
+            if nums[l as usize].abs() > nums[r as usize].abs() {
+                sq[i as usize] = nums[l as usize] * nums[l as usize];
+                l += 1;
+            } else {
+                sq[i as usize] = nums[r as usize] * nums[r as usize];
+                r -= 1;
+            }
+            i -= 1;
+        }
+        
+        sq
+    }
+}
+
+fn abs(x: i32) -> i32 {
+    if x < 0 {
+        x * -1
+    } else {
+        x
+    }
+}