【LeetCode】#137只出现一次的数字II(Single Number II)

【LeetCode】#137只出现一次的数字II(Single Number II)

题目描述

给定一个非空整数数组，除了某个元素只出现一次以外，其余每个元素均出现了三次。找出那个只出现了一次的元素。
说明：
你的算法应该具有线性时间复杂度。 你可以不使用额外空间来实现吗？

示例

示例 1:

输入: [2,2,3,2]
输出: 3

示例 2:

输入: [0,1,0,1,0,1,99]
输出: 99

Description

Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Example

Example 1:

Input: [2,2,3,2]
Output: 3

Example 2:

Input: [0,1,0,1,0,1,99]
Output: 99

解法

class Solution {
    public int singleNumber(int[] nums) {
        Arrays.sort(nums);
        int res = -1;
        for(int i=0; i<nums.length; i+=3){
            if(i==nums.length-1){
                return nums[i];
            }
            if(nums[i]!=nums[i+1]){
                res = nums[i];
                break;
            }
        }
        return res;
    }
}