Move History

Rooted by: YourFirstSolution
Fork Selected
  • Code 
    fn missing_number(nums: &[u32]) -> u32 {
    (0..=nums.len() as u32).find(|n| !nums.contains(&n)).unwrap()
}
     Test Cases 
    #[test]
fn test() {
    assert_eq!(missing_number(&[0, 1, 2, 3, 4, 6, 7, 8, 9]), 5);
    assert_eq!(missing_number(&[0, 1, 3, 4]), 2);
    assert_eq!(missing_number(&[1, 2, 3, 4, 5]), 0);
    assert_eq!(missing_number(&[0, 1, 2, 3, 4]), 5);
    assert_eq!(missing_number(&[0]), 1);
    assert_eq!(missing_number(&[1]), 0);
}
    View Run Output
  • Code
    • class Solution {
    • public:
    • int missingNumber(vector<int>& nums) {
    • }
    • };
    • fn missing_number(nums: &[u32]) -> u32 {
    • (0..=nums.len() as u32).find(|n| !nums.contains(&n)).unwrap()
    • }
     Test Cases
    • #include <criterion/criterion.h>
    • // Function to find the missing number in an array of integers
    • int findMissingNumber(int arr[], int n) {
    • // Code to find the missing number
    • #[test]
    • fn test() {
    • assert_eq!(missing_number(&[0, 1, 2, 3, 4, 6, 7, 8, 9]), 5);
    • assert_eq!(missing_number(&[0, 1, 3, 4]), 2);
    • assert_eq!(missing_number(&[1, 2, 3, 4, 5]), 0);
    • assert_eq!(missing_number(&[0, 1, 2, 3, 4]), 5);
    • assert_eq!(missing_number(&[0]), 1);
    • assert_eq!(missing_number(&[1]), 0);
    • }
    • Test(findMissingNumber, should_return_5_for_given_array) {
    • int arr[] = {1, 2, 3, 4, 6, 7, 8, 9, 10};
    • int n = sizeof(arr) / sizeof(arr[0]);
    • cr_assert_eq(findMissingNumber(arr, n), 5);
    • }
    • Test(findMissingNumber, should_return_2_for_given_array) {
    • int arr[] = {1, 3, 4, 5};
    • int n = sizeof(arr) / sizeof(arr[0]);
    • cr_assert_eq(findMissingNumber(arr, n), 2);
    • }