src/algorithms/string/is-palindrome/README.md

@@ -0,0 +1,3 @@
+## 回文串
+
+递归算法

src/algorithms/string/is-palindrome/__tests__/isPalindrome.test.js

@@ -0,0 +1,11 @@
+import isPalindrome from '../isPalindrome';
+
+describe('isPalindrome', () => {
+  it('should be a palindrome string', () => {
+    expect(isPalindrome('level')).toBe(true);
+    expect(isPalindrome('noon')).toBe(true);
+  });
+  it('should not be a palindrome string', () => {
+    expect(isPalindrome('devel')).toBe(false);
+  });
+});

src/algorithms/string/is-palindrome/isPalindrome.js

@@ -0,0 +1,14 @@
+export default function isPalindrome(str) {
+  const len = str.length;
+  const first = str[0];
+  const last = str[str.length - 1];
+
+  if (len === 0 || len === 1) {
+    return true;
+  }
+
+  if (first === last) {
+    return isPalindrome(str.substring(1, str.length - 1));
+  }
+  return false;
+}

src/data-structures/priority-queue/PriorityQueue.js

@@ -5,7 +5,7 @@ import Comparator from '../../utils/comparator/Comparator';
 // we take into account its priority instead of the element's value.
 export default class PriorityQueue extends MinHeap {
   constructor() {
-    // Call MinHip constructor first.
+    // Call MinHeap constructor first.
     super();
 
     // Setup priorities map.