Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitae946f1

Browse files
authored
Sri Hari: Batch-4/Neetcode-All/Added-articles (neetcode-gh#3770)
* Batch-4/Neetcode-All/Added-articles* Batch-4/Neetcode-150/Added-articles
1 parentd15fd78 commitae946f1

11 files changed

+7281
-175
lines changed

‎articles/cheapest-flight-path.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -265,7 +265,7 @@ class Solution {
265265
* Time complexity: $O((n + m) * k)$
266266
* Space complexity: $O(n * k)$
267267

268-
> Where $n$ is the number offlights, $m$ is the number ofedgesand $k$ is the number of stops.
268+
> Where $n$ is the number ofcities, $m$ is the number offlightsand $k$ is the number of stops.
269269

270270
---
271271

@@ -478,7 +478,7 @@ class Solution {
478478
* Time complexity: $O(n + (m * k))$
479479
* Space complexity: $O(n)$
480480

481-
> Where $n$ is the number offlights, $m$ is the number ofedgesand $k$ is the number of stops.
481+
> Where $n$ is the number ofcities, $m$ is the number offlightsand $k$ is the number of stops.
482482

483483
---
484484

@@ -734,4 +734,4 @@ class Solution {
734734
* Time complexity: $O(n * k)$
735735
* Space complexity: $O(n + m)$
736736

737-
> Where $n$ is the number offlights, $m$ is the number ofedgesand $k$ is the number of stops.
737+
> Where $n$ is the number ofcities, $m$ is the number offlightsand $k$ is the number of stops.

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp