• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    N-Repeated Element in Size 2N Array

    less than 1 minute read

    <-E 961> N-Repeated Element in Size 2N Array

    class Solution {
    public:
        int repeatedNTimes(vector<int>& A) {
            for (int i = 2; i < A.size(); ++i){
                if(A[i] == A[i - 1] or A[i] == A[i-2]){
                    return A[i];
                }
            }
            return A[0];
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: November 1, 2020

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.