Skip to content

Conversation

@harryleonardo
Copy link

Adding :

1480.Running-Sum-of-1d-Array
1512.Number-of-Good-Pairs

Both of them implemented using Golang and also already covered by unit test.

@codecov-commenter
Copy link

Codecov Report

Merging #71 into master will increase coverage by 0.03%.
The diff coverage is 100.00%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master      #71      +/-   ##
==========================================
+ Coverage   71.59%   71.63%   +0.03%     
==========================================
  Files         521      523       +2     
  Lines        9355     9366      +11     
==========================================
+ Hits         6698     6709      +11     
  Misses       2399     2399              
  Partials      258      258              
Impacted Files Coverage Δ
...ng-Sum-of-1d-Array/1480.Running-Sum-of-1d-Array.go 100.00% <100.00%> (ø)
....Number-of-Good-Pairs/1512.Number-of-Good-Pairs.go 100.00% <100.00%> (ø)

Continue to review full report at Codecov.

Legend - Click here to learn more
Δ = absolute <relative> (impact), ø = not affected, ? = missing data
Powered by Codecov. Last update 5830c8d...44f8b5b. Read the comment docs.

@halfrost halfrost merged commit 97add95 into halfrost:master Sep 24, 2020
halfrost added a commit that referenced this pull request Sep 24, 2020
halfrost added a commit that referenced this pull request Sep 24, 2020
@halfrost
Copy link
Owner

1480 这道题你的解法不够好,没有 beat 100%,我重新写了一版,其实只用一层循环就可以解决了。时间复杂度 O(n)。

halfrost added a commit that referenced this pull request Sep 24, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants