Package net.n1da.dev.euler

Class PE0004

java.lang.Object

net.n1da.dev.euler.core.Problem

net.n1da.dev.euler.PE0004

All Implemented Interfaces:

Solvable

public class PE0004
extends Problem

Solution for problem 4 "Largest palindrome product" completed on Thu, 9 Apr 2015, 06:15.

Since:

08.04.2015 17:56:52

Author:

Nico Danneberg

See Also:

Problem @ Project Euler, Solution @ Ni-Da-Net

Field Summary

Fields inherited from class net.n1da.dev.euler.core.Problem

number, title

Constructor Summary

Constructors

Constructor	Description
PE0004()	A simple constructor to set number and title.

Method Summary

Modifier and Type	Method	Description
java.lang.String	solve()	Solves this problem using two nested loops - one from i = 100 to 1000 and an inner loop from j = i to 1000.

Methods inherited from class net.n1da.dev.euler.core.Problem

finish, getResult, getRuntime, prepare, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

PE0004

public PE0004()

A simple constructor to set number and title.

Method Detail

solve

public java.lang.String solve()

Solves this problem using two nested loops - one from i = 100 to 1000 and an inner loop from j = i to 1000. The product of i and j is checked to be an palindrome. If one is found, it is tested to be the found maximum.

Returns:

the largest palindrome as product of 2 three-digit numbers

See Also:

Mathe.isPalindrome(int), Palindromic number @ Wikipedia