Tested ok with sequences:
1n n1 1n1 n1n
But somehow requirements does not met (
package com.codegym.task.task19.task1923;
/*
Words with numbers
*/
import java.io.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Solution {
public static void main(String[] args) throws IOException {
//args = new String[] {"g:\\input.txt", "g:\\output.txt"};
BufferedReader fileReader = new BufferedReader(new FileReader(args[0]));
BufferedWriter fileWriter = new BufferedWriter(new FileWriter(args[1]));
String line;
Pattern pattern = Pattern.compile("\\b" +
"([a-zA-z_]*[0-9]+[a-zA-z_]*)" +
"", Pattern.COMMENTS);
while ((line = fileReader.readLine()) != null) {
Matcher matcher = pattern.matcher(line);
while (matcher.find()) {
fileWriter.write(matcher.group() + " ");
}
fileWriter.newLine();
}
fileReader.close();
fileWriter.close();
}
}