leetcode 551. Student Attendance Record I

You are given a string representing an attendance record for a student. The record only contains the following three characters:

1. 'A' : Absent.
2. 'L' : Late.
3. 'P' : Present.

A student could be rewarded if his attendance record doesn't contain more than one 'A' (absent) or more than two continuous 'L' (late).

You need to return whether the student could be rewarded according to his attendance record.

Example 1:

Input: "PPALLP"
Output: True

Example 2:

Input: "PPALLL"
Output: False

这道题”more than two continuous 'L' “我的理解是超过两个连续的'L'，即PLLL是不可以的，而PLLPLLPLL是可以的。按照这个思路写代码，最后也AC了。

package leetcode;

public class Student_Attendance_Record_I_551 {

	public boolean checkRecord(String s) {
		if(s.length()<=1){
			return true;
		}	
		char[] cs=s.toCharArray();
		int A_occured=0;
		int i=0;
		while(i<cs.length){
			char c=cs[i];
			if(c=='P'){
				i++;
			}
			else if(c=='A'){
				A_occured++;
				if(A_occured>1){
					return false;
				}
				i++;
			}
			else{ //c=='L'
				int L_continuous=1;
				i++;
				while(i<cs.length&&cs[i]=='L'){
					L_continuous++;
					i++;
				}
				if(L_continuous>2){
					return false;
				}
			}
		}
		return true;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Student_Attendance_Record_I_551 s=new Student_Attendance_Record_I_551();
		System.out.println(s.checkRecord("PPALLL"));
	}

}

大神用一行就解决了：正则表达式！

public boolean checkRecord(String s) {
    return !s.matches(".*LLL.*|.*A.*A.*");
}

还有的大神使用了java中的string里的函数：

public class Solution {
    public boolean checkRecord(String s) {
        if(s.indexOf("A") != s.lastIndexOf("A") || s.contains("LLL"))
            return false;
        return true;
    }
}