refactor code

Author: codejsha

programmers/problem12909/CorrectParenthesis_Integer.java

@@ -0,0 +1,32 @@
+package problem12909;
+
+/**
+ * Total score: 100.0 / 100.0
+ */
+public class CorrectParenthesis_Integer {
+    public static void main(String[] args) {
+        var s = "()()";
+        var sol = new CorrectParenthesis_Integer();
+        System.out.println(sol.solution(s));
+    }
+
+    boolean solution(String s) {
+        if (s.startsWith(")") || s.endsWith("(") || s.length() % 2 != 0) {
+            return false;
+        }
+
+        var counter = 0;
+        for (var letter : s.toCharArray()) {
+            if (letter == '(') {
+                counter++;
+            } else {
+                if (counter == 0) {
+                    return false;
+                }
+                counter--;
+            }
+        }
+
+        return counter == 0;
+    }
+}

programmers/problem12909/CorrectParenthesis_Split.java

@@ -31,9 +31,6 @@ boolean solution(String s) {
             }
         }
 
-        if (!stack.isEmpty()) {
-            return false;
-        }
-        return true;
+        return stack.isEmpty();
     }
 }

programmers/problem12953/NLeastCommonMultiple.java

@@ -30,6 +30,13 @@ public int gcd(int a, int b) {
         return a;
     }
 
+    public int gcdRecursive(int a, int b) {
+        if (b == 0) {
+            return a;
+        }
+        return gcdRecursive(b, a % b);
+    }
+
     public int lcm(int a, int b) {
         return (a * b) / gcd(a, b);
     }

programmers/problem42628/DoubleEndedPriorityQueue_PriorityQueue.java

@@ -1,6 +1,8 @@
 package problem42628;
 
-import java.util.*;
+import java.util.Arrays;
+import java.util.Comparator;
+import java.util.PriorityQueue;
 
 public class DoubleEndedPriorityQueue_PriorityQueue {
     public static void main(String[] args) {

programmers/problem76502/RotateParentheses.java

@@ -28,14 +28,13 @@ public int solution(String s) {
         var stack = new Stack<Character>();
 
         for (var i = 0; i < s.length(); i++) {
-            var temp = s.substring(i) + s.substring(0, i);
+            var shifted = s.substring(i) + s.substring(0, i);
 
             stack.clear();
             var isCorrect = true;
-            for (var ch : temp.toCharArray()) {
+            for (var ch : shifted.toCharArray()) {
                 if (ch == '(' || ch == '[' || ch == '{') {
                     stack.push(ch);
-
                 } else {
                     if (stack.isEmpty()) {
                         isCorrect = false;
@@ -44,6 +43,7 @@ public int solution(String s) {
 
                     var current = stack.peek();
                     stack.pop();
+                    
                     if (ch == ')' && current != '(') {
                         isCorrect = false;
                         break;
@@ -55,7 +55,6 @@ public int solution(String s) {
                         break;
                     }
                 }
-
             }
 
             if (stack.isEmpty() && isCorrect) count++;

programmers/problem76502/RotateParentheses_Module.java

@@ -1,5 +1,6 @@
 package problem76502;
 
+import java.util.Arrays;
 import java.util.Stack;
 
 public class RotateParentheses_Module {
@@ -37,13 +38,12 @@ public int solution(String s) {
         return count;
     }
 
-    private boolean isCorrectParentheses(String temp) {
+    private boolean isCorrectParentheses(String shifted) {
         var stack = new Stack<Character>();
 
-        for (var ch : temp.toCharArray()) {
+        for (var ch : shifted.toCharArray()) {
             if (ch == '(' || ch == '[' || ch == '{') {
                 stack.push(ch);
-
             } else {
                 if (stack.isEmpty()) {
                     return false;