hashmap-codealong

时间:2024-04-26 07:58:10
【文件属性】:

文件名称:hashmap-codealong

文件大小:2KB

文件格式:ZIP

更新时间:2024-04-26 07:58:10

JavaScript

实验室-解决哈希图问题! 问题-isSubArray 给定两个数组,其中arr1.length> arr2.length,请检查arr2是否为子数组。 顺序没关系! isSubArray ( [ "hey" , "what" , "is" , "up" , "with" , "hashmap" ] , [ "up" , "with" , "hashmap" ] ) ; // --> true isSubArray ( [ "hey" , "what" , "is" , "up" , "with" , "hashmap" ] , [ "down" , "with" , "hashmap" ] ) ; // --> false, contains a word that's not in the first list isSubArray ( [ "hey" , "wh


【文件预览】:
hashmap-codealong-main
----is-sub-array.js(597B)
----two-sum.js(812B)
----readme.md(1KB)

网友评论