Added one solution & modified one solution

varunu28 · varunu28 · commit 1b90428f89ea · 2020-09-22T11:00:13.000-05:00
diff --git a/Medium/Insert into a Sorted Circular Linked List.java b/Medium/Insert into a Sorted Circular Linked List.java
@@ -0,0 +1,49 @@
+/*
+// Definition for a Node.
+class Node {
+    public int val;
+    public Node next;
+
+    public Node() {}
+
+    public Node(int _val) {
+        val = _val;
+    }
+
+    public Node(int _val, Node _next) {
+        val = _val;
+        next = _next;
+    }
+};
+*/
+
+class Solution {
+  public Node insert(Node head, int insertVal) {
+    if (head == null) {
+      Node newNode = new Node(insertVal);
+      newNode.next = newNode;
+      return newNode;
+    }
+    Node prev = head;
+    Node curr = head.next;
+    boolean insert = false;
+    do {
+      if (prev.val <= insertVal && insertVal <= curr.val) {
+        insert = true;
+      } 
+      else if (prev.val > curr.val) {
+        if (insertVal >= prev.val || insertVal <= curr.val) {
+          insert = true;
+        }
+      }
+      if (insert) {
+        prev.next = new Node(insertVal, curr);
+        return head;
+      }
+      prev = curr;
+      curr = curr.next;
+    } while (prev != head);
+    prev.next = new Node(insertVal, curr);
+    return head;
+  }
+}
diff --git a/Medium/Majority Element II.java b/Medium/Majority Element II.java
@@ -1,46 +1,46 @@
 class Solution {
   public List<Integer> majorityElement(int[] nums) {
-    int count1 = 0;
-    int count2 = 0;
-    Integer candidate1 = null;
-    Integer candidate2 = null;
+    int countOne = 0;
+    int countTwo = 0;
+    Integer candidateOne = null;
+    Integer candidateTwo = null;
     for (int num : nums) {
-      if (candidate1 != null && candidate1 == num) {
-        count1++; 
+      if (candidateOne != null && candidateOne == num) {
+        countOne++;
       }
-      else if (candidate2 != null && candidate2 == num) {
-        count2++;
+      else if (candidateTwo != null && candidateTwo == num) {
+        countTwo++;
       }
-      else if (count1 == 0) {
-        candidate1 = num;
-        count1 = 1;
+      else if (countOne == 0) {
+        candidateOne = num;
+        countOne = 1;
       }
-      else if (count2 == 0) {
-        candidate2 = num;
-        count2 = 1;
+      else if (countTwo == 0) {
+        candidateTwo = num;
+        countTwo = 1;
       }
       else {
-        count1--;
-        count2--;
+        countOne--;
+        countTwo--;
       }
     }
-    List<Integer> ans = new ArrayList<>();
-    count1 = 0;
-    count2 = 0;
+    List<Integer> result = new ArrayList<>();
+    countOne = 0;
+    countTwo = 0;
     for (int num : nums) {
-      if (candidate1 != null && candidate1 == num) {
-        count1++;
+      if (candidateOne != null && candidateOne == num) {
+        countOne++;
       }
-      else if (candidate2 != null && candidate2 == num) {
-        count2++;
+      else if (candidateTwo != null && candidateTwo == num) {
+        countTwo++;
       }
     }
-    if (count1 > nums.length / 3) {
-      ans.add(candidate1);
+    if (countOne > nums.length / 3) {
+      result.add(candidateOne);
     }
-    if (count2 > nums.length / 3) {
-      ans.add(candidate2);
+    if (countTwo > nums.length / 3) {
+      result.add(candidateTwo);
     }
-    return ans;
+    return result;
   }
 }
