1. Список говнокодов пользователя itrofan-ebufsehjidov

    Всего: 1

  2. Java / Говнокод #17556

    +64

    1. 01
    2. 02
    3. 03
    4. 04
    5. 05
    6. 06
    7. 07
    8. 08
    9. 09
    10. 10
    11. 11
    12. 12
    13. 13
    14. 14
    15. 15
    16. 16
    17. 17
    18. 18
    19. 19
    20. 20
    21. 21
    22. 22
    23. 23
    24. 24
    25. 25
    26. 26
    27. 27
    28. 28
    29. 29
    30. 30
    31. 31
    32. 32
    33. 33
    34. 34
    35. 35
    36. 36
    37. 37
    38. 38
    39. 39
    40. 40
    41. 41
    42. 42
    43. 43
    44. 44
    45. 45
    46. 46
    47. 47
    48. 48
    49. 49
    import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class PolynomialParser {
	
	public Polynomial parse(String rawPolynomial) {
		String source = normalizeSourceString(rawPolynomial);
		Map<Integer, Integer> result = new HashMap<>();
		
		StringTokenizer tokenizer = new StringTokenizer(source, "[+-]", true);
		boolean isCurrentNegative = false;
		int currentDegree;
		int currentCoefficient;
		while (tokenizer.hasMoreTokens()) {
			String currentToken = tokenizer.nextToken();
			if ("-".equals(currentToken)) {
				isCurrentNegative = true;
			} else if ("+".equals(currentToken)) {
				isCurrentNegative = false;
			} else {
				if (currentToken.contains("x")) {
					if (currentToken.contains("^")) {
						String[] tmp = currentToken.split("x\\^");
						currentDegree = Integer.parseInt(tmp[1]);
						int draftCoefficient = Integer.parseInt(tmp[0]);
						currentCoefficient = (isCurrentNegative) ? - draftCoefficient : draftCoefficient;
					} else {
						currentDegree = 1;
						String[] tmp = currentToken.split("x");
						int draftCoefficient = (tmp.length == 0) ? 1 : Integer.parseInt(tmp[0]);
						currentCoefficient = (isCurrentNegative) ? - draftCoefficient : draftCoefficient;
					}
				} else {
					currentDegree = 0;
					int draftCoefficient = Integer.parseInt(currentToken);
					currentCoefficient = (isCurrentNegative) ? - draftCoefficient : draftCoefficient;
				}
				result.put(currentDegree, currentCoefficient);
			}
		}
		return new Polynomial(result);
	}
	
	private String normalizeSourceString(String source) {
		String result = source.replaceAll("\\s+","");
		return result.toLowerCase();
	}
}

    Из сегодняшнего. Парсинг многочленов.

    itrofan-ebufsehjidov, 01 Февраля 2015

    Комментарии (21)