本文共 707 字，大约阅读时间需要 2 分钟。

reference: 

Problem Definition:

Parity: Parity of a number refers to whether it contains an odd or even number of 1-bits. The number has “odd parity”, if it contains odd number of 1-bits and is “even parity” if it contains even number of 1-bits.

Solution:

1. Initialize parity = 02. Loop while n != 0            a. Invert parity              parity = !parity      b. Unset rightmost set bit             n = n & (n-1)3. return parity

Code:

/* Function to get parity of number n. It returns 1   if n has odd parity, and returns 0 if n has even   parity */bool getParity(unsigned int n){    bool parity = 0;    while (n)    {        parity = !parity;        n      = n & (n - 1);    }            return parity;}

转载地址：http://bexti.baihongyu.com/