We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Picking Numbers
  5. Discussions

Picking Numbers

  • zettix1
     + 0 comments

    Simple unsorted n-squared solution.

    // Write your code here
    int maxcount = 0;
    for (int i = 0; i < a.size(); i++) {
        int v = a.get(i);
        int count = 1;
        for (int j = 0; j < a.size(); j++) {
            if (i == j) {
                continue;
            }   
            int q = a.get(j);
            if (v == q || v == q - 1) {
                count++;
            }   
        }   
        if (count > maxcount) {
            maxcount = count;
        }
    return maxcount;
}