LongestSequence

Download Result.java Copy to Clipboard

package LongestSequenceGradingCode;

public class Result  
{
	int numLeftEdge;
	int numRightEdge;
	int numLongest;
	boolean entireRange;
	
	public Result(int l, int r, int m, boolean a)
	{
		numLeftEdge = l;
		numRightEdge = r;
		numLongest = m;
		entireRange = a;
	}
	
	public Result(int l, int r)
	{
		numLeftEdge = l;
		numRightEdge = r;
		numLongest = 0;
		entireRange = false;
	}
	
	public Result()
	{
		numLeftEdge = 0;
		numRightEdge = 0;
		numLongest = 0;
		entireRange = false;
	}
	
	public void incrementLeft()
	{
		numLeftEdge++;
	}
	
	public void incrementRight()
	{
		numRightEdge++;
	}
	
	public int getNumLeftEdge()
	{
		return numLeftEdge;
	}
	
	public int getNumRightEdge()
	{
		return numRightEdge;
	}
	
	public int getNumLongest()
	{
		return numLongest;
	}
	
	public boolean getEntireRange()
	{
		return entireRange;
	}
	
	public void setNumLeftEdge(int num)
	{
		numLeftEdge = num;
	}
	
	public void setNumRightEdge(int num)
	{
		numRightEdge = num;
	}
	
	public void setNumLongest(int longest)
	{
		numLongest = longest;
	}

	public void setEntireRange(boolean b) {
		entireRange = b;
		
	}
	

}