136.single-number.1.kt

/*
 * @lc app=leetcode id=136 lang=kotlin
 *
 * [136] Single Number
 *
 * https://leetcode.com/problems/single-number/description/
 *
 * algorithms
 * Easy (59.44%)
 * Total Accepted:    443.7K
 * Total Submissions: 743.8K
 * Testcase Example:  '[2,2,1]'
 *
 * Given a non-empty array of integers, every element appears twice except for
 * one. Find that single one.
 *
 * Note:
 *
 * Your algorithm should have a linear runtime complexity. Could you implement
 * it without using extra memory?
 *
 * Example 1:
 *
 *
 * Input: [2,2,1]
 * Output: 1
 *
 *
 * Example 2:
 *
 *
 * Input: [4,1,2,1,2]
 * Output: 4
 *
 *
 */
class Solution_singleNumber_1 {
    fun singleNumber(nums: IntArray): Int = nums.reduce(Int::xor)
}