[leet] 567. Permutation in String [medium]

Author: hyeonbinHur

허현빈/5주차/260126-1.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number[]} nums
+ * @return {number[][]}
+ */
+var permute = function(nums) {
+    const ans =[]
+    const bkArr =[ ]
+    const visit = Array.from({length: nums.length}).fill(false)
+    const bk = (k) =>{
+        if(k >= nums.length){
+            const newArr = JSON.parse(JSON.stringify(bkArr))
+            ans.push(newArr)
+            return
+        }
+        for(let i = 0 ; i < nums.length; i++){
+            if(!visit[i]){
+                visit[i] = true;
+                bkArr[k] = nums[i]
+                bk(k+1)
+                visit[i] = false;
+            }
+        }
+    }
+    bk(0)
+    return ans
+};

허현빈/5주차/260126-2.js

@@ -0,0 +1,32 @@
+/**
+ * @param {string} s1
+ * @param {string} s2
+ * @return {boolean}
+ */
+var checkInclusion = function(s1, s2) {
+
+    const s1Count = Array(26).fill(0);
+    const s2Count = Array(26).fill(0);
+    const aCode = 'a'.charCodeAt(0); 
+
+    for (let i = 0; i < s1.length; i++) {
+        s1Count[s1.charCodeAt(i) - aCode]++;
+        s2Count[s2.charCodeAt(i) - aCode]++;
+    }
+  
+    const matches = (arr1, arr2) => {
+        for (let i = 0; i < 26; i++) {
+            if (arr1[i] !== arr2[i]) return false;
+        }
+        return true;
+    };
+    for (let i = 0; i < s2.length ; i++) {
+        if (matches(s1Count, s2Count)) {
+            return true;
+        }
+        s2Count[s2.charCodeAt(i + s1.length) - aCode]++;
+        s2Count[s2.charCodeAt(i) - aCode]--;
+    }
+
+    return matches(s1Count, s2Count);
+};