class Solution {
public static boolean containsDuplicate(int[] nums) {


        for (int i = 1; i < nums.length; i++) {
            int copyI = i;

            int current = nums[i];
            int prev = nums[i - 1];

              if(current == prev)
                return true;

            while (current < prev) {
                
                nums[i] = prev;
                nums[i - 1] = current;
                i--;
                if(i == 0)
                    break;
                current = nums[i];
                prev = nums[i - 1];

                  if(current == prev)
                return true;
            }

            i = copyI;
        }

        return false;
    }
}