mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 00:07:00 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix sphinx/build_docs warnings for greedy_methods (#12463)

Browse Source 
* updating DIRECTORY.md

* Fix sphinx/build_docs warnings for greedy_methods

* Improve

---------

Co-authored-by: MaximSmolskiy <MaximSmolskiy@users.noreply.github.com>
This commit is contained in:
Maxim Smolskiy 2024-12-23 16:11:58 +03:00 committed by GitHub
parent c5e603ae42
commit b0cb13fea5
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
greedy_methods/smallest_range.py
View File

@ -14,12 +14,13 @@ def smallest_range(nums: list[list[int]]) -> list[int]:
Uses min heap for efficiency. The range includes at least one number from each list. Uses min heap for efficiency. The range includes at least one number from each list.
Args: Args:
nums: List of k sorted integer lists. `nums`: List of k sorted integer lists.
Returns: Returns:
list: Smallest range as a two-element list. list: Smallest range as a two-element list.
Examples: Examples:
>>> smallest_range([[4, 10, 15, 24, 26], [0, 9, 12, 20], [5, 18, 22, 30]]) >>> smallest_range([[4, 10, 15, 24, 26], [0, 9, 12, 20], [5, 18, 22, 30]])
[20, 24] [20, 24]
>>> smallest_range([[1, 2, 3], [1, 2, 3], [1, 2, 3]]) >>> smallest_range([[1, 2, 3], [1, 2, 3], [1, 2, 3]])