Reverse String Java - Figuring out Complexity (Time & Space)
$begingroup$
Been revamping on my coding puzzles practices...
What is the complexity (both time & space) for this method:
public static String reverse(String word) {
if (word == null || "".equals(word) || word.length() == 1) {
throw new IllegalArgumentException("Invalid Entry");
}
StringBuilder result = new StringBuilder();
for (int i=word.length() - 1; i >= 0; i--) {
result.append(word.charAt(i));
}
return result.toString();
}
Is this a more optimized solution (what is the time & space complexity of this one as well):
public static String reverse ( String s ) {
int length = s.length(), last = length - 1;
char chars = s.toCharArray();
for ( int i = 0; i < length/2; i++ ) {
char c = chars[i];
chars[i] = chars[last - i];
chars[last - i] = c;
}
return new String(chars);
}
Know that there might be duplicate questions similar to this but am not asking for a solution, am only seeking how to figure out the two different types of complexities...
If someone has a better solution using Java, please post.
java complexity
$endgroup$
add a comment |
$begingroup$
Been revamping on my coding puzzles practices...
What is the complexity (both time & space) for this method:
public static String reverse(String word) {
if (word == null || "".equals(word) || word.length() == 1) {
throw new IllegalArgumentException("Invalid Entry");
}
StringBuilder result = new StringBuilder();
for (int i=word.length() - 1; i >= 0; i--) {
result.append(word.charAt(i));
}
return result.toString();
}
Is this a more optimized solution (what is the time & space complexity of this one as well):
public static String reverse ( String s ) {
int length = s.length(), last = length - 1;
char chars = s.toCharArray();
for ( int i = 0; i < length/2; i++ ) {
char c = chars[i];
chars[i] = chars[last - i];
chars[last - i] = c;
}
return new String(chars);
}
Know that there might be duplicate questions similar to this but am not asking for a solution, am only seeking how to figure out the two different types of complexities...
If someone has a better solution using Java, please post.
java complexity
$endgroup$
add a comment |
$begingroup$
Been revamping on my coding puzzles practices...
What is the complexity (both time & space) for this method:
public static String reverse(String word) {
if (word == null || "".equals(word) || word.length() == 1) {
throw new IllegalArgumentException("Invalid Entry");
}
StringBuilder result = new StringBuilder();
for (int i=word.length() - 1; i >= 0; i--) {
result.append(word.charAt(i));
}
return result.toString();
}
Is this a more optimized solution (what is the time & space complexity of this one as well):
public static String reverse ( String s ) {
int length = s.length(), last = length - 1;
char chars = s.toCharArray();
for ( int i = 0; i < length/2; i++ ) {
char c = chars[i];
chars[i] = chars[last - i];
chars[last - i] = c;
}
return new String(chars);
}
Know that there might be duplicate questions similar to this but am not asking for a solution, am only seeking how to figure out the two different types of complexities...
If someone has a better solution using Java, please post.
java complexity
$endgroup$
Been revamping on my coding puzzles practices...
What is the complexity (both time & space) for this method:
public static String reverse(String word) {
if (word == null || "".equals(word) || word.length() == 1) {
throw new IllegalArgumentException("Invalid Entry");
}
StringBuilder result = new StringBuilder();
for (int i=word.length() - 1; i >= 0; i--) {
result.append(word.charAt(i));
}
return result.toString();
}
Is this a more optimized solution (what is the time & space complexity of this one as well):
public static String reverse ( String s ) {
int length = s.length(), last = length - 1;
char chars = s.toCharArray();
for ( int i = 0; i < length/2; i++ ) {
char c = chars[i];
chars[i] = chars[last - i];
chars[last - i] = c;
}
return new String(chars);
}
Know that there might be duplicate questions similar to this but am not asking for a solution, am only seeking how to figure out the two different types of complexities...
If someone has a better solution using Java, please post.
java complexity
java complexity
asked 18 mins ago
PacificNW_LoverPacificNW_Lover
15816
15816
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f214084%2freverse-string-java-figuring-out-complexity-time-space%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f214084%2freverse-string-java-figuring-out-complexity-time-space%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown