public ArrayList<String> fullJustify(String[] words, int L) {
		// Start typing your Java solution below
		// DO NOT write main() function
		int n = words.length;
		ArrayList<String> res = new ArrayList<String>();
		if (n == 0)
			return res;
		int i = 0, j = 0;
		while (i < n) {
			int cnt = 0;
			for (j = i; j < n; j++) {
				if (cnt > 0) {
					if (cnt + words[j].length() + 1 > L)
						break;
					cnt++; // 娉ㄦ剰鏄笉break涓斾笉鏄涓�釜璇嶇殑鏃跺�鎵�+
				}
				cnt += words[j].length();
			}
			res.add(justify(words, i, j - 1, cnt, L)); // 璁板緱j-1
			i = j; // 涓嬩竴涓瓧绗�
		}
		return res;
	}