Data update

Task/Rep-string/C++/rep-string-2.cpp

@@ -0,0 +1,40 @@
+#include <cstdint>
+#include <iomanip>
+#include <iostream>
+#include <iterator>
+#include <sstream>
+#include <string>
+#include <vector>
+
+std::string repeat(const std::string& text, const int32_t& repetitions) {
+    std::stringstream stream;
+    std::fill_n(std::ostream_iterator<std::string>(stream), repetitions, text);
+    return stream.str();
+}
+
+std::vector<std::string> rep_string(const std::string& text) {
+	std::vector<std::string> repetitions;
+
+	for ( uint64_t len = 1; len <= text.length() / 2; ++len ) {
+		std::string possible = text.substr(0, len);
+		uint64_t quotient = text.length() / len;
+		uint64_t remainder = text.length() % len;
+		std::string candidate = repeat(possible, quotient) + possible.substr(0, remainder);
+		if ( candidate == text ) {
+			repetitions.emplace_back(possible);
+		}
+	}
+	return repetitions;
+}
+
+int main() {
+	const std::vector<std::string> tests = { "1001110011", "1110111011", "0010010010",
+		"1010101010", "1111111111", "0100101101", "0100100", "101", "11", "00", "1" };
+
+	std::cout << "The longest rep-strings are:" << std::endl;
+	for ( const std::string& test : tests ) {
+		std::vector<std::string> repeats = rep_string(test);
+		std::string result = repeats.empty() ? "Not a rep-string" : repeats.back();
+		std::cout << std::setw(10) << test << " -> " << result << std::endl;
+	}
+}

Task/Rep-string/Java/rep-string-2.java

@@ -0,0 +1,33 @@
+import java.util.ArrayList;
+import java.util.List;
+
+public final class RepStrings {
+
+	public static void main(String[] aArgs) {
+		List<String> tests = List.of( "1001110011", "1110111011", "0010010010",
+			"1010101010", "1111111111", "0100101101", "0100100", "101", "11", "00", "1" );
+
+		System.out.println("The longest rep-strings are:");
+		for ( String test : tests ) {
+			List<String> repeats = repString(test);
+			String result = repeats.isEmpty() ? "Not a rep-string" : repeats.get(repeats.size() - 1);
+			System.out.println(String.format("%10s%s%s", test, " -> ", result));
+		}
+	}
+	
+	private static List<String> repString(String aText) {
+		List<String> repetitions = new ArrayList<String>();
+		
+		for ( int length = 1; length <= aText.length() / 2; length++ ) {
+			String possible = aText.substring(0, length);
+			int quotient = aText.length() / length;
+			int remainder = aText.length() % length;
+			String candidate = possible.repeat(quotient) + possible.substring(0, remainder);
+			if ( candidate.equals(aText) ) {
+				repetitions.add(possible);
+			}
+		}
+		return repetitions;
+	}
+
+}