Previous
Previous
Graph Traversals
Next
Next
# O(n^2) | |
def appendNtimesUsingStringConcat(c: str, n: int) -> str: | |
out_str = "" | |
for i in range(n): | |
out_str += c # O(s) where s = length(out_str) | |
return out_str | |
# O(n) | |
def appendNtimesUsingStringJoin(c: str, n: int) -> str: | |
list = [] | |
for i in range(n): | |
list.append(c); # O(1) | |
return "".join(list) | |
// O(n^2) | |
public void appendNtimesUsingStringConcat(char c, int n) { | |
String str = ""; | |
for (int i = 0; i < n; i++) { | |
str += c; // O(s) where s = length(str) | |
} | |
return str; | |
} | |
// O(n) | |
public void appendNtimesUsingStringBuilder(char c, int n) { | |
StringBuilder sb = new StringBuilder(); | |
for (int i = 0; i < n; i++) { | |
sb.append(c); // O(1) | |
} | |
return sb.toString(); | |
} |
Tricks