From 8bf522bb5ad1d4ea74a2bac598b28fc2dde5abe2 Mon Sep 17 00:00:00 2001 From: anushka-0099 Date: Fri, 20 Dec 2024 11:15:13 +0530 Subject: [PATCH] contribute to #9943 --- dynamic_programming/climbing_stairs.py | 2 +- sorts/merge_sort.py | 2 ++ 2 files changed, 3 insertions(+), 1 deletion(-) diff --git a/dynamic_programming/climbing_stairs.py b/dynamic_programming/climbing_stairs.py index d6273d025f08..30f137036806 100644 --- a/dynamic_programming/climbing_stairs.py +++ b/dynamic_programming/climbing_stairs.py @@ -3,7 +3,7 @@ def climb_stairs(number_of_steps: int) -> int: """ - LeetCdoe No.70: Climbing Stairs + LeetCode No.70: Climbing Stairs Distinct ways to climb a number_of_steps staircase where each time you can either climb 1 or 2 steps. diff --git a/sorts/merge_sort.py b/sorts/merge_sort.py index 0628b848b794..ec2210205b1d 100644 --- a/sorts/merge_sort.py +++ b/sorts/merge_sort.py @@ -26,6 +26,8 @@ def merge_sort(collection: list) -> list: [] >>> merge_sort([-2, -5, -45]) [-45, -5, -2] + >>> merge_sort([90,-90,2,15,39,-54,0]) + [-90,-54,0,2,15,39,90] """ def merge(left: list, right: list) -> list: