From 345562d1b7ccf52fbee3cdcd79e4570a7398df7e Mon Sep 17 00:00:00 2001 From: cato447 Date: Mon, 16 Aug 2021 18:29:45 +0200 Subject: [PATCH] Added two solutions to longest palindrome and median of two sorted arrays --- longestPalindrome.py | 21 +++++++++++++++++++++ medianOfTwoSortedArrays.py | 17 +++++++++++++++++ 2 files changed, 38 insertions(+) create mode 100644 longestPalindrome.py create mode 100644 medianOfTwoSortedArrays.py diff --git a/longestPalindrome.py b/longestPalindrome.py new file mode 100644 index 0000000..a660451 --- /dev/null +++ b/longestPalindrome.py @@ -0,0 +1,21 @@ +#https://leetcode.com/problems/longest-palindromic-substring/submissions/ + +class Solution: + def longestPalindrome(self, s: str) -> str: + longestSub = "" + for base in range(len(s)): + for length in range(len(s)-base): + print(base, length, s[base:len(s)-length]) + if s[base:len(s)-length] == s[base:len(s)-length][::-1]: + if len(s[base:len(s)-length]) > len(longestSub): + if base == 0 and length == len(s): + return s[base:len(s)-length] + longestSub = s[base:len(s)-length] + return longestSub + +def main(): + solution = Solution() + print(solution.longestPalindrome("1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111")) + +if __name__ == '__main__': + main() diff --git a/medianOfTwoSortedArrays.py b/medianOfTwoSortedArrays.py new file mode 100644 index 0000000..5136de1 --- /dev/null +++ b/medianOfTwoSortedArrays.py @@ -0,0 +1,17 @@ +# https://leetcode.com/problems/median-of-two-sorted-arrays/ + +class Solution: + def findMedianSortedArrays(self, nums1: list, nums2: list) -> float: + nums1.extend(nums2) + nums1.sort() + if len(nums1) % 2 != 0: + return nums1[int(len(nums1)/2)] + else: + return (nums1[int(len(nums1)/2)] + nums1[int(len(nums1)/2)-1]) / 2 + +def main(): + solution = Solution() + print(solution.findMedianSortedArrays([],[2])) + +if __name__ == '__main__': + main() \ No newline at end of file