APT: DNA Max

Problem Statement

You are writing code to find which of several scanned DNA strands has the most occurrences of a specific nucleotide. If more than one strand has the same maximal number of the specified nucleotide you should return the longest strand with the maximal number. All DNA strands have different lengths in this problem so the maximal strand will be unique when length is accounted for. Return this uniquely maximal strand.

Definition

Class: DNAMaxNucleotide
Method: max
Parameters: String[] strands String n
Returns: String
Method signature:
```
   String max(String[] strands, String n)
```
(be sure your method is public)

Class

public class DNAMaxNucleotide { public String max(String[] strands, String n) { // fill in code here } }

Notes

Constraints

strands will contain no more than 50 elements, each element will be a different length and the characters of the the strings will only be 'a', 'g', 't', or 'c'.
n will be a one character string, either "a", "g", "t", or "c".

Examples

```
 strands = {"agt", "aagt", "taattt", "ccatg" }
 n = "a"
```
Returns: "taattt" since both "aagt" and "taattt" have two occurrences of 'a', but "taattt" is longer.
```
 strands = {"agt", "aagt", "taattt", "ccatc" }
 n = "g"
```
Returns: "aagt" since both "aagt" and "agt" have one occurrence of 'g', but "aagt" is longer.

Owen L. Astrachan

Last modified: Mon Sep 24 10:07:34 EDT 2007