Welcome to the Java Programming Forums

The professional, friendly Java community. 21,500 members and growing!

The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.

>> REGISTER NOW TO START POSTING

Members have full access to the forums. Advertisements are removed for registered users.

# Thread: Urgent - Please help to form code

1. ## Urgent - Please help to form code

A zero-indexed array A consisting of N integers is given. A triplet (P, Q, R) is called a triangle if 0 ≤ P < Q < R < N and:
A[P] + A[Q] > A[R],
A[Q] + A[R] > A[P],
A[R] + A[P] > A[Q].
The perimeter of such a triangle equals A[P] + A[Q] + A[R]. For example, consider the following array A:
A = 10
A = 2
A = 5
A = 1
A = 8
A = 20
Triplet (0, 2, 4) is a triangle and its perimeter equals 10 + 5 + 8 = 23. There is no other triangle in this array with a larger perimeter.
Write a function:
class Solution { public int solution(int[] A); }
that, given a zero-indexed array A of N integers, returns the maximum perimeter of any triangle in this array. The function should return −1 if there are no triangles.
For example, given:
A = 10
A = 2
A = 5
A = 1
A = 8
A = 20
the function should return 23, as explained above.
Given array A such that:
A = 5
A = 10
A = 18
A = 7
A = 8
A = 3
the function should return 25: the triangle with the maximum perimeter is (1, 3, 4).
While for an array A:
A = 10
A = 20
A = 30
the function should return −1, as it is impossible to create a triangle.
Assume that:
N is an integer within the range [0..100,000];
each element of array A is an integer within the range [1..100,000,000].
Complexity:
expected worst-case time complexity is O(N*log(N));
expected worst-case space complexity is O(1), beyond input storage (not counting the storage required for input arguments).
Elements of input arrays can be modified. 3. ## Re: Urgent - Please help to form code

This thread has been cross posted here:

Although cross posting is allowed, for everyone's benefit, please read:

Java Programming Forums Cross Posting Rules 