From ae62fc6cc8fab46cc4719a52a3b63288493400ba Mon Sep 17 00:00:00 2001
From: Khushi2217 <89858412+Khushi2217@users.noreply.github.com>
Date: Wed, 12 Oct 2022 13:50:17 +0530
Subject: [PATCH] Update 1043-partition-array-for-maximum-sum.py

---
 .../1043-partition-array-for-maximum-sum.py               | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/1043-partition-array-for-maximum-sum/1043-partition-array-for-maximum-sum.py b/1043-partition-array-for-maximum-sum/1043-partition-array-for-maximum-sum.py
index 7746530..45b0ed6 100644
--- a/1043-partition-array-for-maximum-sum/1043-partition-array-for-maximum-sum.py
+++ b/1043-partition-array-for-maximum-sum/1043-partition-array-for-maximum-sum.py
@@ -3,10 +3,10 @@ def maxSumAfterPartitioning(self, arr: List[int], K: int) -> int:
         dp = [0 for i in range(len(arr))]
         for i in range(len(arr)):
             dp[i] = arr[i] + (dp[i-1] if i-1>=0 else 0)
-            temp = arr[i]
+            t = arr[i]
             for j in range(1,K):
                 if i-j>=0:
                     index = i-j
-                    temp = max(temp,arr[i-j])
-                    dp[i] = max(dp[i],temp*(i-index+1) + (dp[index-1] if index-1 >=0 else 0))
-        return dp[-1]
\ No newline at end of file
+                    t = max(t,arr[i-j])
+                    dp[i] = max(dp[i],t*(i-index+1) + (dp[index-1] if index-1 >=0 else 0))
+        return dp[-1]