LeetCode

461. Hamming Distance

public class Solution {
    public int HammingDistance(int x, int y) {
         string str1 = Convert.ToString(x, 2);
            string str2 = Convert.ToString(y,2);
            if (str1.Length > str2.Length)
                str2 = str2.PadLeft(str1.Length, '0');
            else
                str1 = str1.PadLeft(str2.Length, '0');
            int count = 0;
            for (int i = 0; i < str1.Length; i++)
            {
                if (!str1.Substring(i, 1).Equals(str2.Substring(i, 1)))
                    count++;
            }
            return count;
    }
}

412. Fizz Buzz

public class Solution {
    public IList<string> FizzBuzz(int n) {
         List<string> list = new List<string>();
            for (int i = 1; i <= n; i++)
            {
                if (i % 3 == 0 & i % 5 == 0)
                    list.Add("FizzBuzz");
                else if  (i % 3 == 0)
                    list.Add("Fizz");
                else if (i % 5== 0)
                    list.Add("Buzz");
                else
                    list.Add(i.ToString());
               
            }
             return list;
    }
}

344. Reverse String

public class Solution {
    public string ReverseString(string s) {
        char[] arr = s.ToCharArray();
            Array.Reverse(arr);
            return new string(arr);
    }
}