Update Determine if Two Strings Are Close.java

varunu28 · web-flow · commit d00ccb6645f0 · 2024-01-14T08:28:46.000-08:00
diff --git a/Medium/Determine if Two Strings Are Close.java b/Medium/Determine if Two Strings Are Close.java
@@ -1,30 +1,30 @@
 class Solution {
-  public boolean closeStrings(String word1, String word2) {
-    if (word1.length() != word2.length()) {
-      return false;
+    public boolean closeStrings(String word1, String word2) {
+        if (word1.length() != word2.length()) {
+            return false;
+        }
+        int[] frequencyOne = getFrequencyArray(word1);
+        int[] frequencyTwo = getFrequencyArray(word2);
+        for (int i = 0; i < 26; i++) {
+            if (frequencyOne[i] == 0 && frequencyTwo[i] != 0) {
+                return false;
+            }
+        }
+        Arrays.sort(frequencyOne);
+        Arrays.sort(frequencyTwo);
+        for (int i = 0; i < 26; i++) {
+            if (frequencyOne[i] != frequencyTwo[i]) {
+                return false;
+            }
+        }
+        return true;
     }
-    int[] frequencyOne = getFrequencyArray(word1);
-    int[] frequencyTwo = getFrequencyArray(word2);
-    for (int i = 0; i < frequencyOne.length; i++) {
-      if (frequencyOne[i] == 0 && frequencyTwo[i] != 0) {
-        return false;
-      }
+
+    private static int[] getFrequencyArray(String s) {
+        int[] frequency = new int[26];
+        for (int i = 0; i < s.length(); i++) {
+            frequency[s.charAt(i) - 'a']++;
+        }
+        return frequency;
     }
-    Arrays.sort(frequencyOne);
-    Arrays.sort(frequencyTwo);
-    for (int i = 0; i < frequencyOne.length; i++) {
-      if (frequencyOne[i] != frequencyTwo[i]) {
-        return false;
-      }
-    }
-    return true;
-  }
-  
-  private int[] getFrequencyArray(String s) {
-    int[] frequency = new int[26];
-    for (char c : s.toCharArray()) {
-      frequency[c - 'a']++;
-    }
-    return frequency;
-  }
 }
