Use `.last()` for better readability

2 files changed, 3 insertions, 3 deletions

diff --git a/src/merkletree.rs b/src/merkletree.rs
index 84d59d2..c16eece 100644
--- a/src/merkletree.rs
+++ b/src/merkletree.rs
@@ -53,7 +53,7 @@ impl MerkleTree {
             .collect();
 
         if leaves.len() % 2 != 0 {
-            leaves.push(leaves[leaves.len() - 1].clone());
+            leaves.push(leaves.last().unwrap().clone());
         }
 
         Self::build(hasher, leaves)
@@ -70,7 +70,7 @@ impl MerkleTree {
         while nodes.len() > 1 {
             if nodes.len() % 2 != 0 {
                 // duplicate last node to make the count even
-                nodes.push(nodes[nodes.len() - 1].clone());
+                nodes.push(nodes.last().unwrap().clone());
             }
 
             let mut next_level = Vec::new();
diff --git a/src/proof.rs b/src/proof.rs
index cfc7a0b..4acfea6 100644
--- a/src/proof.rs
+++ b/src/proof.rs
@@ -77,7 +77,7 @@ impl Proofer for DefaultProofer<'_> {
         while current_level.len() > 1 {
             // Ensure even number of nodes at this level
             if current_level.len() % 2 != 0 {
-                current_level.push(current_level[current_level.len() - 1].clone());
+                current_level.push(current_level.last().unwrap().clone());
             }
 
             // Find the sibling of the current node