public String truncateSentence(String s, int k){ String[] words = s.split("\\s+"); StringBuilder sb = new StringBuilder(); for (int i = 0; i < k; i++) { sb.append(words[i]).append(" "); }
public String truncateSentence(String s, int k){ StringBuilder sb = new StringBuilder(); int len = s.length(); for (int i = 0; i < len; i++) { sb.append(s.charAt(i)); if (s.charAt(i) == ' ') { k--; } if (k == 0) { sb.deleteCharAt(sb.length() - 1); break; } }
int len = s.length(); int first = -1; int second = -1; if (s.equals(goal)) { int[] count = newint[26]; for (int i = 0; i < len; i++) { count[s.charAt(i) - 'a']++; if (count[s.charAt(i) - 'a'] > 1) { returntrue; } } returnfalse; } else { for (int i = 0; i < len; i++) { if (s.charAt(i) != goal.charAt(i)) { if (first == -1) { first = i; } elseif (second == -1) { second = i; } else { returnfalse; } } } }
if (first != second && first >= 0 && second >= 0 && s.charAt(first) == goal.charAt(second) && s.charAt(second) == goal.charAt(first)) { returntrue; }
returnfalse; }
复杂度分析
时间复杂度:O(N),其中N为s的长度。
空间复杂度:O(1)。
All suggestions are welcome.
If you have any query or suggestion please comment below.
Please upvote👍 if you like💗 it. Thank you:-)