Competitive-Coding-10 completed

buy_sell_stock_II.py

@@ -0,0 +1,11 @@
+
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        max_profit=0
+        for i in range(1,len(prices)):
+            if prices[i]>prices[i-1]:
+                max_profit+=prices[i]-prices[i-1]
+        return max_profit
+
+
+

peeking_iterator.py

@@ -0,0 +1,32 @@
+class PeekingIterator:
+    def __init__(self, iterator):
+        """
+        Initialize your data structure here.
+        :type iterator: Iterator
+        """
+        self.iterator = iterator
+        self.next_val = iterator.next() if iterator.hasNext() else None
+
+        """
+        Returns the next element in the iteration without advancing the iterator.
+        :rtype: int
+        """
+
+    def peek(self):
+        return self.next_val
+
+    def next(self):
+        """
+        :rtype: int
+        """
+        cur = self.next_val
+        self.next_val = self.iterator.next() if self.iterator.hasNext() else None
+        return cur
+
+    def hasNext(self):
+        """
+        :rtype: bool
+        """
+        return self.next_val is not None
+
+