2012. Sum of Beauty in the Array: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1516,3 +1516,4 @@ mod s2007_find_original_array_from_doubled_array;
 mod s2008_maximum_earnings_from_taxi;
 mod s2009_minimum_number_of_operations_to_make_array_continuous;
 mod s2011_final_value_of_variable_after_performing_operations;
+mod s2012_sum_of_beauty_in_the_array;

src/solution/s2012_sum_of_beauty_in_the_array.rs

@@ -0,0 +1,89 @@
+/**
+ * [2012] Sum of Beauty in the Array
+ *
+ * You are given a 0-indexed integer array nums. For each index i (1 <= i <= nums.length - 2) the beauty of nums[i] equals:
+ *
+ * 	2, if nums[j] < nums[i] < nums[k], for all 0 <= j < i and for all i < k <= nums.length - 1.
+ * 	1, if nums[i - 1] < nums[i] < nums[i + 1], and the previous condition is not satisfied.
+ * 	0, if none of the previous conditions holds.
+ *
+ * Return the sum of beauty of all nums[i] where 1 <= i <= nums.length - 2.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [1,2,3]
+ * Output: 2
+ * Explanation: For each index i in the range 1 <= i <= 1:
+ * - The beauty of nums[1] equals 2.
+ *
+ * Example 2:
+ *
+ * Input: nums = [2,4,6,4]
+ * Output: 1
+ * Explanation: For each index i in the range 1 <= i <= 2:
+ * - The beauty of nums[1] equals 1.
+ * - The beauty of nums[2] equals 0.
+ *
+ * Example 3:
+ *
+ * Input: nums = [3,2,1]
+ * Output: 0
+ * Explanation: For each index i in the range 1 <= i <= 1:
+ * - The beauty of nums[1] equals 0.
+ *
+ *  
+ * Constraints:
+ *
+ * 	3 <= nums.length <= 10^5
+ * 	1 <= nums[i] <= 10^5
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/sum-of-beauty-in-the-array/
+// discuss: https://leetcode.com/problems/sum-of-beauty-in-the-array/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn sum_of_beauties(nums: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2012_example_1() {
+        let nums = vec![1, 2, 3];
+
+        let result = 2;
+
+        assert_eq!(Solution::sum_of_beauties(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2012_example_2() {
+        let nums = vec![2, 4, 6, 4];
+
+        let result = 1;
+
+        assert_eq!(Solution::sum_of_beauties(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2012_example_3() {
+        let nums = vec![3, 2, 1];
+
+        let result = 0;
+
+        assert_eq!(Solution::sum_of_beauties(nums), result);
+    }
+}