C#练习题答案: 位计数【难度：2级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

位计数【难度:2级】:

答案1:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {
    return Convert.ToString(n, 2).Count(x => x == '1');
  }
}​

答案2:

using System;
using System.Linq;
public class Kata
{
  public static int CountBits(int n)
  {
    return Convert.ToString(n, 2).Count(x => x == '1');;
  }
}​

答案3:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {
    return Convert.ToString(n, 2).Count(x => (x == '1'));
  }
}​

答案4:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {
    return Convert.ToString(n, 2).ToList().Count(x => x == '1');
  }
}​

答案5:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {
    return (Convert.ToString(n, 2)).Count(x=>x=='1');
  }
}​

答案6:

using System;
using System.Linq;
public class Kata
{
  public static int CountBits(int n)
  {
    return (Convert.ToString(n, 2).Count(x => x == '1'));
  }
}​

答案7:

using System;

public class Kata
{
  public static int CountBits(int n)
  {
    int result = 0;
    while(n > 0)
    {
      result += n & 1;
      n >>= 1;
    }
    return result;
  }
}​

答案8:

using System;

public class Kata
{
  public static int CountBits(int n)
  {
    return (n == 0) ? 0 : (n & 1) + CountBits(n >> 1);
  }
}​

答案9:

using System;

public class Kata
{
  public static int CountBits(int n)
  {
    return n == 0 ? 0 : (n & 1) + CountBits(n >> 1);
  }
}​

答案10:

using System;

public class Kata
{
  public static int CountBits(int n)
  {
    return n == 0 ? 0 : ((n & 1) + CountBits(n >> 1));
  }
}​

答案11:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n) => Convert.ToString(n, 2).Count(f => f == '1');
}​

答案12:

public class Kata
{
  public static int CountBits(int n) => System.Text.RegularExpressions.Regex.Replace(System.Convert.ToString(n, 2), "[^1]", string.Empty).Length;
}​

答案13:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {
    return (Convert.ToString(n, 2)).Where(l => l == '1').Count();
  }
}​

答案14:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {    
    return Convert.ToString(n,2).Where(l => l == '1').Count();
  }
}​

答案15:

return (Convert.ToString(n, 2)).Count(l => l == '1');​

答案16:

using System;

public class Kata
{
  public static int CountBits(int n)
  {
    long v = (n & 0x55555555) + ((n & 0xaaaaaaaa) >> 1);
    v = (v & 0x33333333) + ((v & 0xcccccccc) >> 2);
    v = (v & 0x0f0f0f0f) + ((v & 0xf0f0f0f0) >> 4);
    return (int) v % 255;
  }
}​

答案17:

public class Kata
{
    public static int CountBits(int n)
    {
        int sumOfBits = 0;
        while (n != 0)
        {
            sumOfBits += n % 2;
            n >>= 1; // n /= 2;
        }
        return sumOfBits;
    }
}​

答案18:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {
      return Convert.ToString(n,2).Count(c => c == '1');
  }
}​

答案19:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {
    return Convert.ToString(n, 2).Count(c => c == '1');;
  }
}​

答案20:

using System;
using System.Linq;
public class Kata
{
  public static int CountBits(int n)
  {
     return (Convert.ToString(n, 2)).Count(c => c == '1');
  }
}​

答案21:

using System;
using System.Linq;

public class Kata
{
  public static int CountBits(int n)
  {
    return Convert.ToString((n),2).Count(c => c == '1');
  }
}​

答案22:

using System;
public class Kata
{
    public static int CountBits(int n)
    {
        char[] CharBinArr = Convert.ToString(n, 2).ToCharArray();
        int Ciunt = 0;
        for (int i = 0; i < CharBinArr.Length; i++)
            if (CharBinArr[i] == '1')
                Ciunt++;
        return Ciunt;

    }
}​