js转ts

Author: leeshifu666

src/array/container-with-most-water.js renamed to src/array/container-with-most-water.ts

@@ -3,7 +3,7 @@
  * @param {number[]} heights
  * @return {number}
  */
-export const maxArea = function (heights) {
+export const maxArea = function (heights:number[]):number {
   let max = 0
 
   let l = 0

src/array/count-number-of-nice-subarrays.js renamed to src/array/count-number-of-nice-subarrays.ts

@@ -4,7 +4,7 @@
  * @param {number} k
  * @return {number}
  */
-export const numberOfSubarrays = function (nums, k) {
+export const numberOfSubarrays = function (nums:number[], k:number):number {
   const odd = []
   odd.push(-1)
 

src/array/count-the-repetitions.js renamed to src/array/count-the-repetitions.ts

@@ -4,7 +4,7 @@
  * @param {string} s2
  * @return {number} 返回可以变为s1的次数
  */
-export const includesInStr = (s1, s2) => {
+export const includesInStr = (s1:string, s2:string):number => {
   let i = 0
   while (s1.length >= s2.length) {
     for (let n = 0, len = s2.length; n < len; n++) {
@@ -26,7 +26,7 @@ export const includesInStr = (s1, s2) => {
  * @param {string} str
  * @param {number} time
  */
-export const getStrCopyByNum = (str, time) => {
+export const getStrCopyByNum = (str:string, time:number) => {
   return str.repeat(time)
 }
 
@@ -68,7 +68,7 @@ export const getStrCopyByNum = (str, time) => {
  * @param {number} n2
  * @return {number}
  */
-export const getMaxRepetitions = function (s1, n1, s2, n2) {
+export const getMaxRepetitions = function (s1:string, n1:number, s2:string, n2:number):number {
   // 保存s2p的记录和对应的countS1,countS2
   const indexMap = new Map()
   let countS1 = 0

src/array/first-unique-character-in-a-string.js renamed to src/array/first-unique-character-in-a-string.ts

@@ -2,7 +2,7 @@
  * @param {string} s
  * @return {character}
  */
-export const firstUniqChar = function (s) {
+export const firstUniqChar = function (s:string) {
   const due = new Set()
   const queue = new Set()
   for (const n of s) {

src/array/house-robber.js renamed to src/array/house-robber.ts

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number}
  */
-export const rob = function (nums) {
+export const rob = function (nums:number[]):number {
   if (!nums) return 0
   const len = nums.length
   if (len === 0) return 0

src/array/jump-game-ii.js renamed to src/array/jump-game-ii.ts

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number}
  */
-export const jump = function (nums) {
+export const jump = function (nums:number[]):number {
   let step = 0 // 跳跃步数
   let maxPosition = 0 // 最大位置
   let lastJumpStepMax = 0 // 最后一次跳跃最大能跳的步数

src/array/jump-game.js renamed to src/array/jump-game.ts

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {boolean}
  */
-export const canJump = function (nums) {
+export const canJump = function (nums:number[]):boolean {
   let maxLength = nums[0]
 
   for (let n = 1, len = nums.length; n < len; n++) {

src/array/kids-with-the-greatest-number-of-candies.js renamed to src/array/kids-with-the-greatest-number-of-candies.ts

@@ -3,6 +3,6 @@
  * @param {number} extraCandies
  * @return {boolean[]}
  */
-export const kidsWithCandies = (candies, extraCandies) => {
+export const kidsWithCandies = (candies:number[], extraCandies:number):boolean[] => {
   return candies.map(n => n + extraCandies >= Math.max(...candies))
 }

src/array/kth-largest-element-in-an-array.js renamed to src/array/kth-largest-element-in-an-array.ts

@@ -1,5 +1,5 @@
 
-export default (arr, k) => {
+export default (arr:number[], k:number) => {
   // 这个方法未必是效率最差的
   return arr.sort((a, b) => b - a)[k - 1]
 

src/array/kth-smallest-element-in-a-sorted-matrix.js renamed to src/array/kth-smallest-element-in-a-sorted-matrix.ts

@@ -3,6 +3,6 @@
  * @param {number} k
  * @return {number}
  */
-export const kthSmallest = function (matrix, k) {
+export const kthSmallest = function (matrix:number[][], k:number):number {
   return matrix.flat().sort((a, b) => a - b)[k - 1]
 }