137. Single Number II

LeetCode medium original: C# #array #backtracking #csharp #leetcode #medium #sort

Task text is translated from Russian for the selected interface language. Code is left unchanged.

LeetCode Static

Дан array целых чисел nums, в котором каждый element встречается три раза, кроме одного, который встречается ровно один раз. find этот единственный element и return его.

C# solution

matched/original

public class Solution {
    public int SingleNumber(int[] nums) {
        Array.Sort(nums);
        for (int i = 0; i < nums.Length - 1; i += 3) {
            if (nums[i] == nums[i + 1]) {
                continue;
            } else {
                return nums[i];
            }
        }
        return nums[nums.Length - 1];
    }
}

C++ solution

auto-draft, review before submit

#include <bits/stdc++.h>
using namespace std;

// Auto-generated C++ draft from the C# solution. Review containers, LINQ and helper types before submit.
class Solution {
public:
    public int SingleNumber(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        for (int i = 0; i < nums.size() - 1; i += 3) {
            if (nums[i] == nums[i + 1]) {
                continue;
            } else {
                return nums[i];
            }
        }
        return nums[nums.size() - 1];
    }
}

Java solution

matched/original

class Solution {
    public int singleNumber(int[] nums) {
        Arrays.sort(nums);

        for (int i = 0; i < nums.length - 1; i += 3) {
            if (nums[i] == nums[i + 1]) {
                continue;
            } else {
                return nums[i];
            }
        }

        return nums[nums.length - 1];
    }
}

JavaScript solution

matched/original

var singleNumber = function (nums) {
    nums.sort();
    for (let i = 0; i < nums.length - 1; i += 3) {
        if (nums[i] == nums[i + 1]) {
            continue;
        } else {
            return nums[i];
        }
    }
    return nums[nums.length - 1];
};

Python solution

matched/original

class Solution:
    def singleNumber(self, nums: List[int]) -> int:

        nums.sort()

        for i in range(0, len(nums) - 1, 3):
            if nums[i] == nums[i + 1]:
                continue
            else:
                return nums[i]

        return nums[len(nums) - 1]

Go solution

matched/original

func singleNumber(nums []int) int {
    sort.Ints(nums)
    for i := 0; i < len(nums)-1; i += 3 {
        if nums[i] == nums[i+1] {
            continue
        } else {
            return nums[i]
        }
    }
    return nums[len(nums)-1]
}

Vacancies for this task

Active vacancies with overlapping task tags are shown.

All vacancies

There are no active vacancies yet.