Merge pull request #2794 from skyclouds2001/typo-fix

修正拼写：Javascript->JavaScript&Typescript->TypeScript

Author: youngyangyang04

problems/0001.两数之和.md

@@ -341,7 +341,7 @@ impl Solution {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 var twoSum = function (nums, target) {

problems/0020.有效的括号.md

@@ -275,7 +275,7 @@ def is_valid(strs)
 end
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 var isValid = function (s) {

problems/0024.两两交换链表中的节点.md

@@ -286,7 +286,7 @@ func swapPairs(head *ListNode) *ListNode {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 var swapPairs = function (head) {

problems/0037.解数独.md

@@ -460,7 +460,7 @@ func isvalid(row, col int, k byte, board [][]byte) bool {
 
 
 
-### Javascript
+### JavaScript
 
 ```Javascript
 var solveSudoku = function(board) {

problems/0045.跳跃游戏II.md

@@ -374,7 +374,7 @@ func max(a, b int) int {
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```Javascript
 var jump = function(nums) {

problems/0046.全排列.md

@@ -272,7 +272,7 @@ func dfs(nums []int, cur int) {
 }
 ```
 
-### Javascript 
+### JavaScript 
 
 ```js
 

problems/0047.全排列II.md

@@ -283,7 +283,7 @@ func dfs(nums []int, cur int) {
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```javascript
 var permuteUnique = function (nums) {

problems/0051.N皇后.md

@@ -451,7 +451,7 @@ func isValid(n, row, col int, chessboard [][]string) bool {
 ```
 
 
-### Javascript 
+### JavaScript 
 ```Javascript
 /**
  * @param {number} n

problems/0053.最大子序和.md

@@ -326,7 +326,7 @@ pub fn max_sub_array(nums: Vec<i32>) -> i32 {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```Javascript
 var maxSubArray = function(nums) {

problems/0054.螺旋矩阵.md

@@ -260,7 +260,7 @@ class Solution {
 }
 ```
 
-### Javascript
+### JavaScript
 ```
 /**
  * @param {number[][]} matrix