fix: use ```js in readme documents

Author: yanglbme

basic/sorting/BubbleSort/README.md

@@ -43,7 +43,7 @@ public class BubbleSort {
 ```
 ### **JavaScript**
 
-```javascript
+```js
 function bubbleSort(inputArr) {
     let len = inputArr.length;
     let swapped = false;

basic/sorting/InsertionSort/README.md

@@ -42,7 +42,7 @@ public class InsertionSort {
 }
 ```
 ### **JavaScript**
-```javascript
+```js
 function insertionSort(inputArr) {
     let len = inputArr.length;
     for (let i = 1; i <= len - 1; i++) {

basic/sorting/MergeSort/README.md

@@ -58,7 +58,7 @@ public class MergeSort {
 
 ### **JavaScript**
 
-```JavaScript
+```js
 function mergeSort(arr) {
     if (arr.length < 2) return arr;
     let mid = Math.ceil(arr.length / 2);

basic/sorting/QuickSort/README.md

@@ -56,7 +56,7 @@ public class QuickSort {
 ```
 ### **JavaScript**
 
-```javascript
+```js
 function quickSort(arr) {
     let len = arr.length;
     return qSort(arr, 0, len - 1);

basic/sorting/SelectionSort/README.md

@@ -42,7 +42,7 @@ public class SelectionSort {
 
 ### **JavaScript**
 
-```javascript
+```js
 function selectionSort(inputArr) {
     let len = inputArr.length;
     for (let i = 0; i <= len - 2; i++) {

basic/sorting/ShellSort/README.md

@@ -43,7 +43,7 @@ public class ShellSort {
 
 ### **JavaScript**
 
-```javascript
+```js
 function shellSort(arr) {
     var len = arr.length;
     var gapSize = Math.floor(len / 2);

lcci/01.01.Is Unique/README_EN.md

@@ -70,7 +70,7 @@ class Solution {
 
 ### **JavaScript**
 
-``` js
+```js
 /**
  * @param {string} astr
  * @return {boolean}

lcci/01.02.Check Permutation/README.md

@@ -83,7 +83,7 @@ class Solution {
 
 ### **JavaScript**
 
-```javascript
+```js
 var CheckPermutation = function(s1, s2) {
     let n1 = s1.length, n2 = s2.length;
     if (n1 != n2) return false;

lcci/01.02.Check Permutation/README_EN.md

@@ -81,7 +81,7 @@ class Solution {
 
 ### **JavaScript**
 
-```javascript
+```js
 var CheckPermutation = function(s1, s2) {
     let n1 = s1.length, n2 = s2.length;
     if (n1 != n2) return false;

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md

@@ -149,7 +149,7 @@ public class Solution {
 
 ### **JavaScript**
 
-``` JavaScript
+```js
 /**
  * @param {number[]} nums
  * @return {number}

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README_EN.md

@@ -129,7 +129,7 @@ public class Solution {
 
 ### **JavaScript**
 
-``` JavaScript
+```js
 /**
  * @param {number[]} nums
  * @return {number}

solution/0200-0299/0237.Delete Node in a Linked List/README.md

@@ -94,7 +94,7 @@ class Solution {
 
 ### **JavaScript**
 
-```javascript
+```js
 /**
  * Definition for singly-linked list.
  * function ListNode(val) {

solution/0200-0299/0237.Delete Node in a Linked List/README_EN.md

@@ -101,7 +101,7 @@ class Solution {
 
 ### **JavaScript**
 
-```javascript
+```js
 /**
  * Definition for singly-linked list.
  * function ListNode(val) {

solution/0200-0299/0283.Move Zeroes/README.md

@@ -79,7 +79,7 @@ class Solution {
 
 ### **JavaScript**
 
-```JavaScript
+```js
 /**
  * @param {number[]} nums
  * @return {void} Do not return anything, modify nums in-place instead.

solution/0200-0299/0283.Move Zeroes/README_EN.md

@@ -78,7 +78,7 @@ class Solution {
 ```
 ### **JavaScript**
 
-```JavaScript
+```js
 /**
  * @param {number[]} nums
  * @return {void} Do not return anything, modify nums in-place instead.

solution/0300-0399/0322.Coin Change/README.md

@@ -83,7 +83,7 @@
 
 动态规划法。
 
-```javascript
+```js
 /**
  * @param {number[]} coins
  * @param {number} amount

solution/0300-0399/0322.Coin Change/README_EN.md

@@ -77,7 +77,7 @@
 
 Dynamic programming.
 
-```javascript
+```js
 /**
  * @param {number[]} coins
  * @param {number} amount