Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
高手
The time complexity of the
longest
method is determined by the operations performed within the method. Let's analyze the operations step by step:Concatenation: The line
String s = s1 + s2;
performs concatenation of the two input stringss1
ands2
. The time complexity of string concatenation in Java is O(n1 + n2), where n1 is the length ofs1
and n2 is the length ofs2
.Distinct: The
distinct()
method is used on theIntStream
created from the concatenated strings
. Thedistinct()
method creates a new stream with distinct elements, which involves iterating through the elements of the stream and keeping track of unique elements. The time complexity of thedistinct()
operation is O(n), where n is the number of characters in the concatenated strings
.Sorting: The
sorted()
method is used to sort the characters in the stream in ascending order. The time complexity of thesorted()
operation is O(n log n), where n is the number of characters in the concatenated strings
.Collecting: The
collect()
method is used to collect the sorted characters back into aStringBuilder
to form the resulting string. Thecollect()
operation iterates through the elements in the stream and appends them to theStringBuilder
. The time complexity of thecollect()
operation is O(n), where n is the number of characters in the concatenated strings
.Overall, the dominant operation is the sorting step with a time complexity of O(n log n). Therefore, the time complexity of the
longest
method is O(n log n), where n is the total number of characters in the concatenated strings
.It's important to note that the time complexity may vary depending on the length of the input strings and the specific implementation of the
distinct()
andsorted()
operations. However, in this case, we can safely say that the time complexity is O(n log n) due to the sorting operation.This comment is hidden because it contains spoiler information about the solution
That's amazing. I managed to do it, on around 60 lines... :D
well damn now i feel dumb XD
Very Clever!!!
Hi, guys, what is the time complexity here?
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
Thats so awesome!
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
Thank you very much!!, in Javascript I had no problems (you know ...), but your comment was useful to do it in Java
I have the same problem and I know what's going on now.
"a1 or a2 is empty" means two aspects,a1==null or a1 has noting.
You have to return -1 in both of the two cases.
Loading more items...