package eecs1022.finala;

/**
 * This question is worth 2.5 marks.  No partial marks will be awarded for this question.
 *
 * @author Franck van Breugel
 */
public class Question5
{
    /**
     * Tests whether the digits occurring in the given string are in strictly increasing order.
     *
     * @param s a string.
     * @return true if the digits occurring in the given string are in strictly increasing order,
     * false otherwise.
     */
    public static boolean isIncreasing(String s)
    {
	boolean increasing = true;
	int prev = -1;
	for (int i = 0; i < s.length() && increasing; i++)
	{
	    char letter = s.charAt(i);
	    if (letter >= '0' && letter <= '9')
	    {
		int number = letter - '0';
		if (number > prev)
		{
		    prev = number;
		}
		else
		{
		    increasing = false;
		}
	    }
	}
        return increasing;
    }

    /**
     * Tests method.  You may add more test cases.
     *
     * @param args not applicable.
     */
    public static void main(String[] args)
    {
        System.out.println(Question5.isIncreasing("a1a2a3a"));
        System.out.println(Question5.isIncreasing("a1a1a2a"));
        System.out.println(Question5.isIncreasing("a1b2c3d"));
        System.out.println(Question5.isIncreasing("aaaa1aa2aa3aaaa"));
        System.out.println(Question5.isIncreasing("910"));
    }
}