Submission 6fe193ab...

ChallengeRemove duplicate elements
Submitter0xea674fdde714fd9...
Submitted at2018-51-27
Gas used512573
/**
 * This file is part of the 1st Solidity Gas Golfing Contest.
 *
 * This work is licensed under Creative Commons Attribution ShareAlike 3.0.
 * https://creativecommons.org/licenses/by-sa/3.0/
 */

pragma solidity 0.4.24;

contract Unique {
    /**
     * @dev Removes all but the first occurrence of each element from a list of
     *      integers, preserving the order of original elements, and returns the list.
     *
     * The input list may be of any length.
     *
     * @param input The list of integers to uniquify.
     * @return The input list, with any duplicate elements removed.
     */
    function uniquify(uint[] input) public pure returns(uint[] ret) {
        uint len = input.length;
        uint lenny = len * 5;
        if (len <= 1) {
            return input;
        }

        uint ptr = 0;
        ret = new uint[](lenny);

        for(uint i = 0; i < len; i++) {
            uint value = input[i];
            uint valueMod = value % (lenny);
            uint storedValue = ret[valueMod];
            if (storedValue == 0) {
                ret[valueMod] = value + 1;
                input[ptr++] = value;
            } else if (storedValue != value + 1) {
                for (
                    bool found = false;
                    !found && ret[valueMod] != 0;
                    valueMod = (valueMod + 1) % (lenny)
                ) {
                    found = (ret[valueMod] == value + 1);
                }
                if (!found) {
                    ret[valueMod] = value + 1;
                    input[ptr++] = value;
                }
            }
        }

        ret = new uint[](ptr);

        for(i = 0; i < ptr; i++) {
            ret[i] = input[i];
        }

        return ret;
    }

}