Changed problems to work with a driver function

Problems/Problem4.py

@@ -0,0 +1,103 @@
+#ProjectEuler/Python/Problem4.py
+#Matthew Ellison
+# Created: 01-28-19
+#Modified: 07-17-20
+#Find the largest palindrome made from the product of two 3-digit numbers
+#Unless otherwise listed, all of my non-standard imports can be gotten from my pyClasses repository at https://bitbucket.org/Mattrixwv/pyClasses
+"""
+	Copyright (C) 2020  Matthew Ellison
+
+	This program is free software: you can redistribute it and/or modify
+	it under the terms of the GNU Lesser General Public License as published by
+	the Free Software Foundation, either version 3 of the License, or
+	(at your option) any later version.
+
+	This program is distributed in the hope that it will be useful,
+	but WITHOUT ANY WARRANTY; without even the implied warranty of
+	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+	GNU Lesser General Public License for more details.
+
+	You should have received a copy of the GNU Lesser General Public License
+	along with this program.  If not, see <https://www.gnu.org/licenses/>.
+"""
+
+
+from Problems.Problem import Problem
+from Stopwatch import Stopwatch
+from Unsolved import Unsolved
+
+
+class Problem4(Problem):
+	#Variables
+	__lowestNum = 100
+	__highestNum = 1000
+
+	#Functions
+	#Constructor
+	def __init__(self):
+		super().__init__("Find the largest palindrome made from the product of two 3-digit numbers")
+		self.palindromes = []	#Holds all of the palindromes
+
+	#Operational functions
+	#Solve the problem
+	def solve(self):
+		#If the problem has already been solved do nothing and end the function
+		if(self.solved):
+			return
+
+		#Start the timer
+		self.timer.start()
+
+		#Loop through every number from __lowestNum to __highestNum twice and multiply every number together
+		for firstNum in range(self.__lowestNum, self.__highestNum + 1):
+			for secondNum in range(firstNum, self.__highestNum + 1):	#You can start at num1 because 100 * 101 == 101 * 100
+				#Get the product
+				currentNum = firstNum * secondNum
+				#If the number is a palindrome add it to the list of palindromes, otherwise ignore it
+				#Using strings makes it easier to determine a palindrome
+				if(str(currentNum) == str(currentNum)[::-1]):
+					self.palindromes.append(currentNum)
+				#If it's not a palindrom ignore it
+
+		#Sort the palindromes so that the last element is the largest
+		self.palindromes.sort()
+
+		#Stop the timer
+		self.timer.stop()
+
+		#Save the results
+		self.result = "The largest palindrome made from the product of two 3-digit numbers is " + str(self.palindromes[len(self.palindromes) - 1])
+
+		#Throw a flag to show the problem is solved
+		self.solved = True
+	#Reset the problem so it can be run again
+	def reset(self):
+		super().reset()
+		self.palindromes.clear()
+	#Gets
+	#Returns the list of all palindromes
+	def getPalindromes(self) -> list:
+		#If the problem hasn't been solved throw an exceptions
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before you can get the list of palindromes")
+		return self.palindromes
+	#Returns the largest palindrome
+	def getLargestPalindrome(self) -> int:
+		#If the problem hasn't been solved throw an exceptions
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before you can get the largest palindrome")
+		return self.palindromes[len(self.palindromes) - 1]
+
+#If you are running this file, automatically start the correct function
+if __name__ == '__main__':
+	problem = Problem4()
+	print(problem.getDescription())	#Print the description of the problem
+	problem.solve()	#Solve the problem
+	#Print the results
+	print(problem.getResult())
+	print("It took " + problem.getTime() + " to solve this algorithm")
+
+"""Results:
+The largest palindrome made from the product of two 3-digit numbers is 906609
+It took 177.314 milliseconds to run this algorithm
+"""