Question
The language is Java Implement MyArrayList and MyLinkedList using MyList interface and MyAbstractList as defined in Java Collection Framework. (5 points) Write code to partition
The language is Java
Implement MyArrayList and MyLinkedList using MyList interface and MyAbstractList as defined in Java Collection Framework. (5 points) Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of x only need to be after the elements less than x. The partition element x can appear anywhere in the right partition; it does not need to appear between the left and right partitions.
- For the following problem use your own created MyArrayList or MyLinkedList if needed. (10 points)
Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidthcharacters and is fully (left and right) justified.
You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces ' ' when necessary so that each line has exactly maxWidth characters.
Extra spaces between words should be distributed as evenly as possible. If the number of spaces on a line do not divide evenly between words, the empty slots on the left will be assigned more spaces than the slots on the right.
For the last line of text, it should be left justified and no extra space is inserted between words.
Note:
- A word is defined as a character sequence consisting of non-space characters only.
- Each word's length is guaranteed to be greater than 0 and not exceed maxWidth.
- The input array words contain at least one word.
Example 1:
Input:
words = ["This", "is", "an", "example", "of", "text", "justification."]
maxWidth = 16
Output:
[
"This is an",
"example of text",
"justification. "
]
Example 2:
Input:
words = ["What","must","be","acknowledgment","shall","be"]
maxWidth = 16
Output:
[
"What must be",
"acknowledgment ",
"shall be "
]
Explanation:Note that the last line is "shall be " instead of "shall be",
because the last line must be left-justified instead of fully-justified.
Note that the second line is also left-justified becase it contains only one word.
Example 3:
Input:
words = ["Science","is","what","we","understand","well","enough","to","explain",
"to","a","computer.","Art","is","everything","else","we","do"]
maxWidth = 20
Output:
[
"Science is what we",
"understand well",
"enough to explain to",
"a computer. Art is",
"everything else we",
"do "
]
===================================================================================================================
Here is my code;
import java.io.*;
import java.util.*;
public class ReArrange {
public static void main(String[] args) {
// Uncomment the words one by one keep only one active at a time
// String[] words = {"This", "is", "an", "example", "of", "text","justification."};
String[] words = { "Science", "is", "what", "we", "understand", "well", "enough", "to", "explain", "to", "a", "computer.", "Art", "is", "everything", "else", "we", "do" };
//String[] words = {"What","must","be","acknowledgement","shall","be"};
// String[] words = {"Science","is","what","we","understand","well","enough","to","explain","to","a","computer.","Art","is","everything","else","we","do"};
int maxwidth = 20;// change the value of maxwidth according to given input
int count = 0;
int i = 0;
System.out.println('[');
StringBuilder sb = new StringBuilder();
while (i < words.length) {//iterate through the words array and store the results in stringbuilder sb
if (count == 0) {
System.out.print('"');
}
if (words[i].length() + count <= maxwidth) {
// System.out.print(words[i]+" ");
sb.append(words[i] + " ");
count += words[i].length() + 1;
i++;
}
else {
System.out.print(sb.toString().substring(0, sb.toString().length() - 1));// print the sb when we exceed the max width
System.out.print('"');
System.out.print(",");
System.out.println();
count = 0;// for next line set count =0
sb = new StringBuilder();// take a new stringbuilder to store new line
;
}
}
System.out.print(sb.toString().substring(0, sb.toString().length() - 1));
System.out.print('"');
System.out.println();
System.out.print(']');
}
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started