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

WilsonKuo · Oct 16, 2024 · ee4c1c5 · ee4c1c5
1 parent 371cfe1
commit ee4c1c5
Show file tree

Hide file tree

Showing 87 changed files with 92 additions and 92 deletions.
diff --git a/problems/0001.两数之和.md b/problems/0001.两数之和.md
@@ -341,7 +341,7 @@ impl Solution {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 var twoSum = function (nums, target) {

diff --git a/problems/0020.有效的括号.md b/problems/0020.有效的括号.md
@@ -275,7 +275,7 @@ def is_valid(strs)
 end
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 var isValid = function (s) {

diff --git a/problems/0024.两两交换链表中的节点.md b/problems/0024.两两交换链表中的节点.md
@@ -286,7 +286,7 @@ func swapPairs(head *ListNode) *ListNode {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 var swapPairs = function (head) {

diff --git a/problems/0037.解数独.md b/problems/0037.解数独.md
@@ -460,7 +460,7 @@ func isvalid(row, col int, k byte, board [][]byte) bool {
 
 
 
-### Javascript
+### JavaScript
 
 ```Javascript
 var solveSudoku = function(board) {

diff --git a/problems/0045.跳跃游戏II.md b/problems/0045.跳跃游戏II.md
@@ -374,7 +374,7 @@ func max(a, b int) int {
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```Javascript
 var jump = function(nums) {

diff --git a/problems/0046.全排列.md b/problems/0046.全排列.md
@@ -271,7 +271,7 @@ func dfs(nums []int, cur int) {
 }
 ```
 
-### Javascript 
+### JavaScript 
 
 ```js
 

diff --git a/problems/0047.全排列II.md b/problems/0047.全排列II.md
@@ -283,7 +283,7 @@ func dfs(nums []int, cur int) {
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```javascript
 var permuteUnique = function (nums) {

diff --git a/problems/0051.N皇后.md b/problems/0051.N皇后.md
@@ -451,7 +451,7 @@ func isValid(n, row, col int, chessboard [][]string) bool {
 ```
 
 
-### Javascript 
+### JavaScript 
 ```Javascript
 /**
  * @param {number} n

diff --git a/problems/0053.最大子序和.md b/problems/0053.最大子序和.md
@@ -290,7 +290,7 @@ pub fn max_sub_array(nums: Vec<i32>) -> i32 {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```Javascript
 var maxSubArray = function(nums) {

diff --git a/problems/0054.螺旋矩阵.md b/problems/0054.螺旋矩阵.md
@@ -260,7 +260,7 @@ class Solution {
 }
 ```
 
-### Javascript
+### JavaScript
 ```
 /**
  * @param {number[][]} matrix

diff --git a/problems/0055.跳跃游戏.md b/problems/0055.跳跃游戏.md
@@ -166,7 +166,7 @@ func max(a, b int ) int {
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```Javascript
 var canJump = function(nums) {

diff --git a/problems/0056.合并区间.md b/problems/0056.合并区间.md
@@ -215,7 +215,7 @@ func max56(a, b int) int {
 ```
 
 
-### Javascript 
+### JavaScript 
 ```javascript
 var merge = function (intervals) {
     intervals.sort((a, b) => a[0] - b[0]);

diff --git a/problems/0062.不同路径.md b/problems/0062.不同路径.md
@@ -411,7 +411,7 @@ func uniquePaths(m int, n int) int {
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```Javascript
 var uniquePaths = function(m, n) {

diff --git a/problems/0063.不同路径II.md b/problems/0063.不同路径II.md
@@ -465,7 +465,7 @@ func uniquePathsWithObstacles(obstacleGrid [][]int) int {
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```Javascript
 var uniquePathsWithObstacles = function(obstacleGrid) {

diff --git a/problems/0070.爬楼梯.md b/problems/0070.爬楼梯.md
@@ -327,7 +327,7 @@ func climbStairs(n int) int {
     return dp[n]
 }
 ```
-### Javascript
+### JavaScript
 ```Javascript
 var climbStairs = function(n) {
     // dp[i] 为第 i 阶楼梯有多少种方法爬到楼顶

diff --git a/problems/0072.编辑距离.md b/problems/0072.编辑距离.md
@@ -313,7 +313,7 @@ func Min(args ...int) int {
 }
 ```
 
-### Javascript：
+### JavaScript：
 
 ```javascript
 const minDistance = (word1, word2) => {

diff --git a/problems/0077.组合.md b/problems/0077.组合.md
@@ -468,7 +468,7 @@ func dfs(n int, k int, start int) {
 }
 ```
 
-### Javascript
+### JavaScript
 未剪枝：
 
 ```js

diff --git a/problems/0078.子集.md b/problems/0078.子集.md
@@ -246,7 +246,7 @@ func dfs(nums []int, start int) {
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```Javascript
 var subsets = function(nums) {

diff --git a/problems/0090.子集II.md b/problems/0090.子集II.md
@@ -376,7 +376,7 @@ func dfs(nums []int, start int) {
 ```
 
 
-### Javascript 
+### JavaScript 
 
 ```Javascript
 

diff --git a/problems/0096.不同的二叉搜索树.md b/problems/0096.不同的二叉搜索树.md
@@ -221,7 +221,7 @@ func numTrees(n int)int{
 }
 ```
 
-### Javascript
+### JavaScript
 
 ```Javascript
 const numTrees =(n) => {

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
@@ -356,7 +356,7 @@ func levelOrder(root *TreeNode) (res [][]int) {
 }
 ```
 
-#### Javascript：
+#### JavaScript：
 
 ```javascript
 var levelOrder = function(root) {
@@ -759,7 +759,7 @@ func levelOrderBottom(root *TreeNode) [][]int {
 }
 ```
 
-#### Javascript:
+#### JavaScript:
 
 ```javascript
 var levelOrderBottom = function (root) {
@@ -1101,7 +1101,7 @@ func rightSideView(root *TreeNode) []int {
 }
 ```
 
-#### Javascript:
+#### JavaScript:
 
 ```javascript
 var rightSideView = function(root) {
@@ -1421,7 +1421,7 @@ func averageOfLevels(root *TreeNode) []float64 {
 }
 ```
 
-#### Javascript：
+#### JavaScript：
 
 ```javascript
 var averageOfLevels = function(root) {
@@ -2109,7 +2109,7 @@ func largestValues(root *TreeNode) []int {
 }
 ```
 
-#### Javascript：
+#### JavaScript：
 
 ```javascript
 var largestValues = function (root) {

diff --git a/problems/0104.二叉树的最大深度.md b/problems/0104.二叉树的最大深度.md
@@ -604,7 +604,7 @@ func maxDepth(root *Node) int {
 }
 ```
 
-### Javascript :
+### JavaScript :
 
 104.二叉树的最大深度
 

diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
@@ -830,7 +830,7 @@ func traverse(node *TreeNode, result *[][]int, currPath *[]int, targetSum int) {
 }
 ```
 
-### Javascript
+### JavaScript
 
 0112.路径总和
 

diff --git a/problems/0115.不同的子序列.md b/problems/0115.不同的子序列.md
@@ -265,7 +265,7 @@ func numDistinct(s string, t string) int {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 const numDistinct = (s, t) => {

diff --git a/problems/0122.买卖股票的最佳时机II.md b/problems/0122.买卖股票的最佳时机II.md
@@ -249,7 +249,7 @@ func max(a, b int) int {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 贪心
 

diff --git a/problems/0134.加油站.md b/problems/0134.加油站.md
@@ -396,7 +396,7 @@ func canCompleteCircuit(gas []int, cost []int) int {
 }
 ```
 
-### Javascript 
+### JavaScript 
 暴力：
 ```js
 var canCompleteCircuit = function(gas, cost) {

diff --git a/problems/0135.分发糖果.md b/problems/0135.分发糖果.md
@@ -234,7 +234,7 @@ func findMax(num1 int, num2 int) int {
 }
 ```
 
-### Javascript
+### JavaScript
 ```Javascript
 var candy = function(ratings) {
     let candys = new Array(ratings.length).fill(1)

diff --git a/problems/0209.长度最小的子数组.md b/problems/0209.长度最小的子数组.md
@@ -266,7 +266,7 @@ var minSubArrayLen = function(target, nums) {
 };
 ```
 
-### Typescript：
+### TypeScript：
 
 ```typescript
 function minSubArrayLen(target: number, nums: number[]): number {

diff --git a/problems/0239.滑动窗口最大值.md b/problems/0239.滑动窗口最大值.md
@@ -401,7 +401,7 @@ func maxSlidingWindow(nums []int, k int) []int {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 /**

diff --git a/problems/0279.完全平方数.md b/problems/0279.完全平方数.md
@@ -346,7 +346,7 @@ func min(a, b int) int {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```Javascript
 // 先遍历物品，再遍历背包

diff --git a/problems/0300.最长上升子序列.md b/problems/0300.最长上升子序列.md
@@ -248,7 +248,7 @@ func lengthOfLIS(nums []int ) int {
 }
 ```
 
-### Javascript:
+### JavaScript:
 
 ```javascript
 const lengthOfLIS = (nums) => {

diff --git a/problems/0309.最佳买卖股票时机含冷冻期.md b/problems/0309.最佳买卖股票时机含冷冻期.md
@@ -393,7 +393,7 @@ func max(a, b int) int {
 
 
 
-### Javascript:
+### JavaScript:
 
 > 不同的状态定义 感觉更容易理解些
 ```javascript

diff --git a/problems/0322.零钱兑换.md b/problems/0322.零钱兑换.md
@@ -427,7 +427,7 @@ impl Solution {
 }
 ```
 
-### Javascript：
+### JavaScript：
 
 ```javascript
 // 遍历物品

diff --git a/problems/0332.重新安排行程.md b/problems/0332.重新安排行程.md
@@ -535,7 +535,7 @@ func findItinerary(tickets [][]string) []string {
 }
 ```
 
-### Javascript 
+### JavaScript 
 
 ```Javascript
 

diff --git a/problems/0343.整数拆分.md b/problems/0343.整数拆分.md
@@ -385,7 +385,7 @@ func integerBreak(n int) int {
 }
 ```
 
-### Javascript
+### JavaScript
 ```Javascript
 var integerBreak = function(n) {
     let dp = new Array(n + 1).fill(0)

diff --git a/problems/0376.摆动序列.md b/problems/0376.摆动序列.md
@@ -466,7 +466,7 @@ func max(a, b int) int {
 }
 ```
 
-### Javascript
+### JavaScript
 
 **贪心**
 

diff --git a/problems/0377.组合总和Ⅳ.md b/problems/0377.组合总和Ⅳ.md
@@ -254,7 +254,7 @@ func combinationSum4(nums []int, target int) int {
 }
 ```
 
-### Javascript：
+### JavaScript：
 
 ```javascript
 const combinationSum4 = (nums, target) => {

diff --git a/problems/0406.根据身高重建队列.md b/problems/0406.根据身高重建队列.md
@@ -270,7 +270,7 @@ func reconstructQueue(people [][]int) [][]int {
 }
 ```
 
-### Javascript 
+### JavaScript 
 
 ```Javascript
 var reconstructQueue = function(people) {

diff --git a/problems/0435.无重叠区间.md b/problems/0435.无重叠区间.md
@@ -311,7 +311,7 @@ func min(a, b int) int {
 }
 ```
 
-### Javascript
+### JavaScript
 - 按右边界排序
 ```Javascript
 var eraseOverlapIntervals = function(intervals) {

diff --git a/problems/0452.用最少数量的箭引爆气球.md b/problems/0452.用最少数量的箭引爆气球.md
@@ -220,7 +220,7 @@ func min(a, b int) int {
 }
 ```
 
-### Javascript 
+### JavaScript 
 ```Javascript
 var findMinArrowShots = function(points) {
     points.sort((a, b) => {
-Original file line number
+Diff line change
@@ Expand Up / @@ -271,7 +271,7 @@ func dfs(nums []int, cur int) { @@
     }
     ```
-    ### Javascript
+    ### JavaScript
     ```js
@@ Expand Down @@