feat: add more

Author: gengjiawen

pools_todo/_0976_largest_perimeter_triangle.rs renamed to Array/_0976_largest_perimeter_triangle.rs

@@ -1,30 +1,41 @@
 // https://leetcode.com/problems/largest-perimeter-triangle
-// 
+//
 // Given an integer array `nums`, return _the largest perimeter of a triangle with a non-zero area, formed from three of these lengths_. If it is impossible to form any triangle of a non-zero area, return `0`.
-// 
+//
 // **Example 1:**
-// 
+//
 // ```
 // **Input:** nums = [2,1,2]
 // **Output:** 5
 // ```
-// 
+//
 // **Example 2:**
-// 
+//
 // ```
 // **Input:** nums = [1,2,1]
 // **Output:** 0
 // ```
-// 
+//
 // **Constraints:**
-// 
+//
 // *   `3 <= nums.length <= 10<sup>4</sup>`
 // *   `1 <= nums[i] <= 10<sup>6</sup>`
 
 pub fn largest_perimeter(nums: Vec<i32>) -> i32 {
-
+    let mut nums_clone = nums.clone();
+    nums_clone.sort_unstable();
+    for i in (0..nums_clone.len()).rev() {
+        if i < 2 {
+            break;
+        }
+        if nums_clone[i] < nums_clone[i - 1] + nums_clone[i - 2] {
+            return nums_clone[i] + nums_clone[i - 1] + nums_clone[i - 2];
+        }
     }
+    return 0;
+}
 
 #[test]
 pub fn t1() {
+    assert_eq!(largest_perimeter(vec![2, 1, 2]), 5);
 }

Array/lib.rs

@@ -44,6 +44,7 @@ mod _0929_unique_email_addresses;
 mod _0944_delete_columns_to_make_sorted;
 mod _0953_verifying_an_alien_dictionary;
 mod _0961_n_repeated_element_in_size_2n_array;
+mod _0976_largest_perimeter_triangle;
 mod _0977_squares_of_a_sorted_array;
 mod _0999_available_captures_for_rook;
 mod _1002_find_common_characters;