HW 12/01

MissingNumber.java

/**
 * Access Code 2.1
 * Ramona Harrison
 * MissingNumber.java
 *
 * I have an array of the numbers 1 to 100 in a random order. One of the numbers is missing.
 * Write an algorithm to figure out the number. *
 *
 */

public class MissingNumber {

    public static int findMissingNumber(int[] numbers) {
        int[] numbersCounted = new int[101];

        for (int i = 0; i < numbers.length; i++) {
            numbersCounted[numbers[i]] = 1;
        }

        for (int i = 1; i < numbersCounted.length; i++) {
            if (numbersCounted[i] != 1) {
                return i;
            }
        }

        return 0;
    }


    public static void main(String[] args) {

        //        for (int i = 1; i <= 100; i++) {
//            System.out.print(i+",");
//        }


        int[] numbers = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100};

        System.out.println(findMissingNumber(numbers));
    }
}

good