Arrays are a fundamental data structure in Rust that allow you to store a fixed-size collection of elements of the same type. A common operation is to calculate the sum of all elements in an array.
In this challenge, you will implement a function to calculate the sum of elements in an array of integers i32.
You need to implement the function sum_array(arr: &[i32]) -> i32 that takes a slice of integers and returns the sum of all elements.
sum_array function should return the sum of all elements in the array.let arr = [1, 2, 3, 4, 5];
let sum = sum_array(&arr);
assert_eq!(sum, 15); // 1 + 2 + 3 + 4 + 5 = 15.iter() method to iterate over the elements of the array..sum() method to calculate the sum of the elements.pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here return arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut sum: i32 = 0; for value in arr.iter() { sum += value; } return sum;}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { let mut res = 0; for i in arr { res += i; } res}pub fn sum_array(arr: &[i32]) -> i32 { let mut res = 0; for i in arr { res += i; } res}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here // let mut result = 0; // for item in arr.iter() { // result += item // } // result let result = arr.iter().sum(); result}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut result = 0; for item in arr.iter() { result += item } result}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let result: i32 = arr.iter().sum(); result}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().fold(0, |total, next| total+next)}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum::<i32>()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum::<i32>()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function herelet total = arr.iter().sum();total}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut sum = 0; for i in arr { sum += i; } sum}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let result: i32 = arr.iter().sum(); return result;}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut sum :i32 = 0; for i in arr.iter() { sum += i; } sum}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut sum :i32 = 0; for i in arr.iter() { sum += *i; } sum}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut sum :i32 = 0; for i in arr.iter() { sum += i; } sum}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here return arr.into_iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let result = arr.iter() .sum(); result}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let result = arr.iter() .sum(); result}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum() }pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut sum: i32 = 0; for i in arr.iter(){ sum = sum + i; } sum}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut result: i32 = 0; for x in 0..arr.len() { result += arr[x]; } result}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut result: i32 = 0; for x in 0..arr.len() { result += arr[x]; } result}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { let sum = arr.iter().sum(); return sum;}pub fn sum_array(arr: &[i32]) -> i32 { let mut sum : i32 = 0; // 声明为可变 for i in 0..arr.len() { // 直接遍历数组的引用 sum += arr[i]; // 使用迭代元素的值 } sum}pub fn sum_array(arr: &[i32]) -> i32 { let mut sum = 0; // 声明为可变 for &i in arr { // 直接遍历数组的引用 sum += i; // 使用迭代元素的值 } sum}pub fn sum_array(arr: &[i32]) -> i32 { return arr.iter().sum();}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let mut sum = 0; for i in arr.iter() { sum += i; } sum}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here let sum: i32 = arr.iter().sum(); return sum}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here arr.iter().sum()}pub fn sum_array(arr: &[i32]) -> i32 { // TODO: Implement the function here return arr.into_iter().sum();}