js转ts

Author: leeshifu666

src/array/container-with-most-water.js 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 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 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 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 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 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 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 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 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 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]
 }

src/array/majority-element.js src/array/majority-element.ts

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number}
  */
-export const majorityElement = function (nums) {
+export const majorityElement = function (nums:number[]):number {
   if (nums.length === 1) return nums[0]
   const tmp = nums.sort((a, b) => a - b)
   const res = tmp[~~(nums.length / 2)]

src/array/maximum-and-minimum.js src/array/maximum-and-minimum.ts

@@ -2,7 +2,7 @@
  * @param matrix: an input matrix
  * @return: nums[0]: the maximum,nums[1]: the minimum
  */
-export const maxAndMin = function (matrix) {
+export const maxAndMin = function (matrix:number[][]) {
   if (matrix[0] === undefined || matrix[0][0] === undefined) return []
   let max = matrix[0][0]
   let min = matrix[0][0]

src/array/maximum-length-of-repeated-subarray.js src/array/maximum-length-of-repeated-subarray.ts

@@ -2,7 +2,7 @@
 // A: [1, 2, 3, 2, 1]
 // B: [3, 2, 1, 4, 7]
 
-const maxLength = function (A, B, addA, addB, len) {
+const maxLength = function (A:number[], B:number[], addA:number, addB:number, len:number) {
   addA = (addA > 0) ? addA : 0
   addB = (addB > 0) ? addB : 0
   let result = 0
@@ -23,7 +23,7 @@ const maxLength = function (A, B, addA, addB, len) {
  * @param {number[]} B
  * @return {number}
  */
-export const findLength = function (A, B) {
+export const findLength = function (A:number[], B:number[]):number {
   const ALen = A.length
   const BLen = B.length
   let result = 0

src/array/maximum-product-subarray.js src/array/maximum-product-subarray.ts

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number}
  */
-export const maxProduct = function (nums) {
+export const maxProduct = function (nums:number[]):number {
   let res = nums[0]
   let prevMin = nums[0]
   let prevMax = nums[0]

src/array/maximum-subarray.js src/array/maximum-subarray.ts

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number}
  */
-export const maxSubArray = function (nums) {
+export const maxSubArray = function (nums:number[]):number {
   let max = nums[0]
   let tmp = 0
   nums.forEach(n => { max = Math.max(tmp > 0 ? tmp += n : tmp = n, max) })

src/array/minimum-cost-for-tickets.js src/array/minimum-cost-for-tickets.ts

@@ -3,7 +3,7 @@
  * @param {number[]} costs
  * @return {number}
  */
-export const mincostTickets = function (days, costs) {
+export const mincostTickets = function (days:number[], costs:number[]) {
   //   动态规划:
   //   dp[i]: 从第i天开始，到最后一天所用的票价总和
 

src/array/partition-array.js src/array/partition-array.ts

@@ -1,6 +1,6 @@
 // LintCode 31. 数组划分 https://www.lintcode.com/problem/partition-array/description
 
-export default (nums, k) => {
+export default (nums:number[], k:number) => {
   if (nums !== null) {
     if (nums.length === 0) return 0
 

src/array/product-of-array-except-self.js src/array/product-of-array-except-self.ts

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

src/array/remove-duplicates-from-sorted-array.js src/array/remove-duplicates-from-sorted-array.ts

@@ -1,7 +1,7 @@
 // LeetCode 26. 删除排序数组中的重复项 https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/
 // LintCode 100. 删除排序数组中的重复数字 https://www.lintcode.com/problem/remove-duplicates-from-sorted-array/description
 
-export default (nums) => {
+export default (nums:number[]):number => {
   if (!nums || (nums && nums.length === 0)) return 0
   let i = 0
   for (let n = 1, len = nums.length; n < len; n++) {

src/array/search-in-rotated-sorted-array.js src/array/search-in-rotated-sorted-array.ts

@@ -3,7 +3,7 @@
  * @param {number} target
  * @return {number}
  */
-export const search = function (nums, target) {
+export const search = function (nums:number[], target:number):number {
   // 参考 src/array/binary-search.js
   let l = 0
   let r = nums.length - 1

src/array/search-insert-position.js src/array/search-insert-position.ts

@@ -3,7 +3,7 @@
  * @param {number} target
  * @return {number}
  */
-var searchInsert = function (nums, target) {
+var searchInsert = function (nums:number[], target:number):number {
   const res = nums.findIndex(item => item === target)
   if (res !== -1) return res
 

src/array/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.js src/array/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.ts

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number[]}
  */
-export const singleNumbers = function (nums) {
+export const singleNumbers = function (nums:number[]):number[] {
   const ab = nums.reduce((a, b) => a ^ b)
   const diff = ab & -ab
   const num1 = nums.reduce((a, n) => n & diff ? a ^ n : a, 0)

src/array/single-number.js src/array/single-number.ts

@@ -2,6 +2,6 @@
  * @param {number[]} nums
  * @return {number}
  */
-export var singleNumber = function (nums) {
+export var singleNumber = function (nums:number[]):number {
   return nums.reduce((a, b) => a ^ b)
 }

src/array/subarray-sums-divisible-by-k.js src/array/subarray-sums-divisible-by-k.ts

@@ -3,7 +3,7 @@
  * @param {number} K
  * @return {number}
  */
-export const subarraysDivByK = function (A, K) {
+export const subarraysDivByK = function (A:number[], K:number):number {
   const map = new Map([[0, 1]]); let sum = 0; let count = 0
 
   A.forEach(n => {

src/math/median-of-two-sorted-arrays.js src/math/median-of-two-sorted-arrays.ts

@@ -5,7 +5,7 @@
  * @param {number[]} nums2
  * @return {number}
  */
-export const findMedianSortedArrays = function (nums1, nums2) {
+export const findMedianSortedArrays = function (nums1:number[], nums2:number[]):number {
   if (nums1.length > nums2.length) return findMedianSortedArrays(nums2, nums1)
 
   const m = nums1.length; const n = nums2.length

src/math/powx-n.js src/math/powx-n.ts

@@ -3,7 +3,7 @@
  * @param {number} n
  * @return {number}
  */
-export const myPow = function (x, n) { // 参考：快速幂 + 迭代 https://leetcode-cn.com/problems/powx-n/solution/powx-n-by-leetcode-solution/
+export const myPow = function (x:number, n:number) { // 参考：快速幂 + 迭代 https://leetcode-cn.com/problems/powx-n/solution/powx-n-by-leetcode-solution/
   let ans = 1.0 // 答案
 
   if (n < 0) { // 如果 n 为负