Skip to content

Instantly share code, notes, and snippets.

@kunyaoxu

kunyaoxu/answer2.md

Created May 19, 2018 06:43
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save kunyaoxu/658b55a02a37e0725b309ccdbd246c8d to your computer and use it in GitHub Desktop.
Save kunyaoxu/658b55a02a37e0725b309ccdbd246c8d to your computer and use it in GitHub Desktop.
Download ZIP
Raw
answer2.md

我answer1的解決方案是O(n^2)的複雜度，要確認第二個輸入的陣列是第一個陣列的子集需要全部一個對一個的去比較， 全部比對完成沒有任何錯誤才會回傳true，那這樣一來所需最大次數就是兩個陣列元素數量的乘積， 舉例:兩個陣列都是長度為10那麼所需的計算次數最大就是10 * 10 = 10^2

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment