We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Strings
  4. Java String Tokens
  5. Discussions

Java String Tokens

  • josuea_tellom
     + 0 comments

    I just "improved" (it doesnt use magic number, and I check if its empty the string one time, but I use more memory) another solution I found on this discussion section. the og solution: https://programmingoneonone.com/hackerrank-java-string-tokens-problem-solution.html

    import java.util.*;

public class Solution {

    public static void main(String[] args) {
        final String splitRegEx = "[^a-zA-Z]";
        List<String> listStrSplited = new LinkedList<>();
        
        Scanner scan = new Scanner(System.in);
        String s = scan.nextLine();
        scan.close();
        
        String [] draftlistStrSplited = s.split(splitRegEx);
        
        for(String splittedStr : draftlistStrSplited){
            if(!splittedStr.isEmpty()){
                listStrSplited.add(splittedStr);
            }
        }
        System.out.println(listStrSplited.size());
        for(String splittedStr : listStrSplited){
            System.out.println(splittedStr);
        }
    }
}