some leetcode examples

Author: Fr4nc3

leetcode/maxprofit.py

@@ -0,0 +1,16 @@
+class Solution(object):
+    def maxProfit(self, prices):
+        """
+        :type prices: List[int]
+        :rtype: int
+        """
+        min_price = float('inf')
+        max_profit = 0
+        for i in range(len(prices)):
+            if prices[i] < min_price:
+                min_price = prices[i]
+            elif prices[i] - min_price > max_profit:
+                max_profit = prices[i] - min_price
+                
+        return max_profit
+        

leetcode/romans.py

@@ -0,0 +1,12 @@
+class Solution(object):
+    def intToRoman(self, num):
+        """
+        :type num: int
+        :rtype: str
+        """
+        thousand = ["", "M", "MM", "MMM"]
+        hundred = ["", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"]
+        ten = ["", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"]
+        one = ["", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"]
+        return (thousand[num // 1000] + hundred[num % 1000 // 100] 
+               + ten[num % 100 // 10] + one[num % 10])

leetcode/twolessthank.py

@@ -0,0 +1,20 @@
+class Solution(object):
+    def twoSumLessThanK(self, nums, k):
+        """
+        :type nums: List[int]
+        :type k: int
+        :rtype: int
+        """
+        nums.sort()
+        answer = -1
+        left = 0
+        right = len(nums) -1
+        while left < right:
+            sum = nums[left] + nums[right]
+            if (sum < k):
+                answer = max(answer, sum)
+                left += 1
+            else:
+                right -= 1
+        return answer
+