• 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

    Count of Matches in Tournament

    less than 1 minute read

    <-E 1688> Count of Matches in Tournament

    class Solution {
    public:
        int numberOfMatches(int n) {
            int matches = 0;
            
            int crm = -1;
            while(crm != 0){
                crm = n / 2;
                matches += crm;
                n = (n + 1) / 2;
            }
            
            return matches;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: December 21, 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.