Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update compare_2_tops.py

Browse Source
This commit is contained in:
marina 2023-08-02 14:16:12 -07:00 committed by GitHub
parent 25054eabb1
commit 2ac7e9a678
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
heaps/compare_2_tops.py
View File

@ -3,7 +3,7 @@
# author: bt3gl
```
'''
You are given an array of integers stones where
stones[i] is the weight of the ith stone.
@ -18,8 +18,7 @@ of weight y has new weight y - x.
At the end of the game, there is at most one stone left.
Return the weight of the last remaining stone.
If there are no stones left, return 0.
```
'''
def last_stone(stones) -> int: