Merge pull request AlgoStudyGroup#55 from sylviadream/sylviadream-patch-1

jinshendan · web-flow · commit 3ec6435e5535 · 2020-05-06T21:27:42.000+02:00
leetcode 0605
diff --git a/May-LeetCoding-Challenge/04-Number-Complement/Number-Complement.cs b/May-LeetCoding-Challenge/04-Number-Complement/Number-Complement.cs
@@ -0,0 +1,7 @@
+public class Solution {
+    public int FindComplement(int num) {        
+        string tempStr = Convert.ToString(num,2);
+        int help = (int)Math.Pow(2,tempStr.Length) - 1;  
+        return num ^ help;
+    }
+}
diff --git a/May-LeetCoding-Challenge/06-Majority-Element/Majority-Element.cs b/May-LeetCoding-Challenge/06-Majority-Element/Majority-Element.cs
@@ -0,0 +1,28 @@
+// I use dictionary in this solution but this is not the best solution
+
+public class Solution {
+    public int MajorityElement(int[] nums) {
+        Dictionary<int, int> dicElement = new Dictionary<int, int>();
+        int i = 0;
+        int n = 0;
+        while (i<nums.Length)
+         {
+           if (dicElement.ContainsKey(nums[i])) 
+           {
+               dicElement[nums[i]]++;
+              if (dicElement[nums[i]]  >= (nums.Length+1)/2)
+              {
+                return nums[i];
+              }
+           }
+           else
+           {
+           	dicElement.Add(nums[i],1);
+           }
+      
+           i++;
+           
+        }
+        return  nums[i-1];
+    }
+}
