Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- function Solve(args) {
- var limit = parseInt(args[1]);
- var count = parseInt(args[0]);
- var words = [];
- var temp = "";
- for (var i = 0; i < count; i++) {
- temp += args[i + 2]+" ";
- }
- words = temp.match(/[^ ]+/g);
- var currentChars = 0;
- var matrix = [];
- var isFull = false;
- var result = "";
- for (var x = 0; words.length > 0; x++) {
- matrix[x] = []
- currentChars = 0;
- isFull = false;
- while(currentChars != limit)
- {
- if (currentChars == 0) {
- currentChars = words[0].length;
- matrix[x].push(words.shift());
- if (words.length == 0) {
- break;
- }
- continue;
- }
- if ((currentChars + 1 + words[0].length) <= limit) {
- currentChars += 1 + words[0].length;
- matrix[x].push(" " + words.shift());
- if (words.length == 0) {
- for (var i = 1; i < matrix[x].length; i++) {
- matrix[x][i] = " " + matrix[x][i];
- currentChars++;
- if (currentChars == limit) {
- break;
- }
- if (i == matrix[x].length - 1) {
- i = 0;
- }
- }
- break;
- }
- continue;
- } else {
- isFull = true;
- }
- if (isFull == true) {
- if (matrix[x].length == 1) {
- break;
- }
- for (var i = 1; i < matrix[x].length; i++) {
- matrix[x][i] = " " + matrix[x][i];
- currentChars++;
- if (currentChars == limit) {
- break;
- }
- if (i == matrix[x].length - 1) {
- i = 0;
- }
- }
- }
- }
- result += matrix[x].join("") + "\n";
- }
- result = result.substring(0,result.length-1);
- return result;
- }
Advertisement
Add Comment
Please, Sign In to add comment