From 2ac7e9a678111e86b682a8dbbabfce4c989bb0a9 Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Wed, 2 Aug 2023 14:16:12 -0700
Subject: [PATCH] Update compare_2_tops.py

---
 heaps/compare_2_tops.py | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/heaps/compare_2_tops.py b/heaps/compare_2_tops.py
index b681de6..55d38ca 100644
--- a/heaps/compare_2_tops.py
+++ b/heaps/compare_2_tops.py
@@ -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: