g2701_2800.s2788_split_strings_by_separator.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
The newest version!
package g2701_2800.s2788_split_strings_by_separator;
// #Easy #Array #String #2023_09_15_Time_3_ms_(99.98%)_Space_44.8_MB_(68.11%)
import java.util.ArrayList;
import java.util.List;
public class Solution {
public List splitWordsBySeparator(List words, char separator) {
List list = new ArrayList<>();
for (String str : words) {
int si = 0;
for (int i = 0; i < str.length(); i++) {
if (str.charAt(i) == separator) {
if (i > si) {
list.add(str.substring(si, i));
}
si = i + 1;
}
}
if (si != str.length()) {
list.add(str.substring(si, str.length()));
}
}
return list;
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy