/**
 *Given a binary array, find the maximum number of consecutive 1s in this array.
 *
 *Example 1:
 *Input: [1,1,0,1,1,1]
 *Output: 3
 *Explanation: The first two digits or the last three digits are consecutive 1s.
 *    The maximum number of consecutive 1s is 3.
 *Note:
 *
 *The input array will only contain 0 and 1.
 *The length of input array is a positive integer and will not exceed 10,000
 *
 */
class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int size = nums.length;
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < size; i++) {
            sb.append(String.valueOf(nums[i]));
        }
        String[] results = sb.toString().split("0");
        int length = results.length;
        int result = 0;
        for (int i = 0; i < length; i++) {
            int temp = results[i].length();
            if (result < temp) result = temp;
        }
        return result;
    }
}

Create MaxConsecutiveOnes.java