test.py

import difflib

def remove_prefix_by_last_line(a: str, b: str, threshold: float = 0.85) -> str:
    """
    基于A的最后一行定位B中的截断点，删除B中该行之前的所有内容
    :param a: 前缀字符串A
    :param b: 目标字符串B
    :param threshold: 行相似度阈值
    :return: 删除前缀后的B字符串
    """
    a_lines = a.splitlines()
    b_lines = b.splitlines()
    
    if not a_lines:
        return b
    
    last_a_line = a_lines[-1]
    cut_index = -1
    
    for i, b_line in enumerate(b_lines):
        similarity = difflib.SequenceMatcher(
            None, last_a_line, b_line
        ).ratio()
        if similarity >= threshold:
            cut_index = i
            break
    
    if cut_index != -1:
        return '\n'.join(b_lines[cut_index+1:])
    else:
        return b


A = "#include<assert.h>\n#include<bits/stdc++.h>\n// Check if in given vector of numbers, are any two numbers closer to each other than\n// given threshold.\n// >>> has_close_elements((std::vector<float>({(float)1.0f, (float)2.0f, (float)3.0f})), (0.5f))\n// (false)\n// >>> has_close_elements((std::vector<float>({(float)1.0f, (float)2.8f, (float)3.0f, (float)4.0f, (float)5.0f, (float)2.0f})), (0.3f))\n// (true)\nbool has_close_elements(std::vector<float> numbers, float threshold) {\n"
B = "#include <assert.h>\n#include <bits/stdc++.h>\n\n// Check if in given vector of numbers, are any two numbers closer to each other than\n// given threshold.\n// >>> has_close_elements((std::vector<float>({(float)1.0f, (float)2.0f, (float)3.0f})), (0.5f))\n// (false)\n// >>> has_close_elements((std::vector<float>({(float)1.0f, (float)2.8f, (float)3.0f, (float)4.0f, (float)5.0f, (float)2.0f})), (0.3f))\n// (true)\nbool has_close_elements(std::vector<float> numbers, float threshold) {\n    // Sort the vector in ascending order\n    std::sort(numbers.begin(), numbers.end());\n\n    // Iterate over the sorted vector\n    for (size_t i = 0; i < numbers.size() - 1; ++i) {\n        // Check if the difference between the current element and the next element is less than the threshold\n        if (numbers[i + 1] - numbers[i] < threshold) {\n            return true; // If a pair of elements is found that are closer than the threshold, return true\n        }\n    }\n\n    // If no pair of elements is found that are closer than the threshold, return false\n    return false;\n}\n\nint main() {\n    std::vector<float> numbers1 = {1.0f, 2.0f, 3.0f};\n    std::vector<float> numbers2 = {1.0f, 2.8f, 3.0f, 4.0f, 5.0f, 2.0f};\n\n    std::cout << std::boolalpha << has_close_elements(numbers1, 0.5f) << std::endl; // Output: false\n    std::cout << std::boolalpha << has_close_elements(numbers2, 0.3f) << std::endl; // Output: true\n\n    return 0;\n}\n"
# print(remove_prefix_by_last_line(A, B))

A = "#include<assert.h>\n#include<bits/stdc++.h>\n// Input to this function is a string containing multiple groups of nested parentheses. Your goal is to\n// separate those group into separate strings and return the vector of those.\n// Separate groups are balanced (each open brace is properly closed) and not nested within each other\n// Ignore any spaces in the input string.\n// >>> separate_paren_groups((\"( ) (( )) (( )( ))\"))\n// (std::vector<std::string>({(std::string)\"()\", (std::string)\"(())\", (std::string)\"(()())\"}))\nstd::vector<std::string> separate_paren_groups(std::string paren_string) {\n"
B = "#include <assert.h>\n#include <bits/stdc++.h>\n\n// Input to this function is a string containing multiple groups of nested parentheses. Your goal is to\n// separate those group into separate strings and return the vector of those.\n// Separate groups are balanced (each open brace is properly closed) and not nested within each other\n// Ignore any spaces in the input string.\n// >>> separate_paren_groups(\"(( )) (( )( ))\")\n// (std::vector<std::string>({(std::string)\"()\", (std::string)\"(())\", (std::string)\"(()())\"}))\n\nstd::vector<std::string> separate_paren_groups(std::string paren_string) {\n    // Remove spaces from the input string\n    paren_string.erase(std::remove(paren_string.begin(), paren_string.end(), ' '), paren_string.end());\n\n    // Initialize an empty vector to store the groups\n    std::vector<std::string> groups;\n\n    // Initialize an empty string to build the current group\n    std::string current_group;\n\n    // Initialize a counter to keep track of the balance of parentheses\n    int balance = 0;\n\n    // Iterate over the characters in the input string\n    for (char c : paren_string) {\n        // If the character is an open parenthesis, increment the balance\n        if (c == '(') {\n            balance++;\n            current_group += c;\n        }\n        // If the character is a close parenthesis, decrement the balance\n        else if (c == ')') {\n            balance--;\n            current_group += c;\n            // If the balance is zero, it means we've found a complete group\n            if (balance == 0) {\n                groups.push_back(current_group);\n                current_group.clear();\n            }\n        }\n        // If the character is not a parenthesis, ignore it\n    }\n\n    // Return the vector of groups\n    return groups;\n}\n\nint main() {\n    std::string paren_string = \"(( )) (( )( ))\";\n    std::vector<std::string> groups = separate_paren_groups(paren_string);\n\n    // Print the groups\n    for (const auto& group : groups) {\n        std::cout << group << std::endl;\n    }\n\n    return 0;\n}\n"
# print(remove_prefix_by_last_line(A, B))


A = "#include<assert.h>\n#include<bits/stdc++.h>\n// The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:\n// fib4(0) -> 0\n// fib4(1) -> 0\n// fib4(2) -> 2\n// fib4(3) -> 0\n// fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).\n// Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.\n// >>> fib4((5))\n// (4)\n// >>> fib4((6))\n// (8)\n// >>> fib4((7))\n// (14)\nlong fib4(long n) {\n"
B = "#include <assert.h>\n#include <bits/stdc++.h>\n\n// The Fib4 number sequence is a sequence similar to the Fibonacci sequence that's defined as follows:\n// fib4(0) -> 0\n// fib4(1) -> 0\n// fib4(2) -> 2\n// fib4(3) -> 0\n// fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).\n// Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.\n\n// We can use dynamic programming to solve this problem efficiently. We will store the results of subproblems in an array to avoid redundant calculations.\n\nlong fib4(long n) {\n    // Base cases\n    if (n <= 1) {\n        return 0;\n    } else if (n == 2) {\n        return 2;\n    } else if (n == 3) {\n        return 0;\n    }\n\n    // Initialize an array to store the results of subproblems\n    long fib4[n + 1];\n\n    // Base cases\n    fib4[0] = 0;\n    fib4[1] = 0;\n    fib4[2] = 2;\n    fib4[3] = 0;\n\n    // Compute the n-th element of the fib4 number sequence\n    for (long i = 4; i <= n; i++) {\n        fib4[i] = fib4[i - 1] + fib4[i - 2] + fib4[i - 3] + fib4[i - 4];\n    }\n\n    // Return the n-th element of the fib4 number sequence\n    return fib4[n];\n}\n\nint main() {\n    // Test the function\n    std::cout << \"fib4(5) = \" << fib4(5) << std::endl;\n    std::cout << \"fib4(6) = \" << fib4(6) << std::endl;\n    std::cout << \"fib4(7) = \" << fib4(7) << std::endl;\n\n    return 0;\n}\n"
# print(remove_prefix_by_last_line(A, B))

A = "package check_if_last_char_is_a_letter_test\n\nimport (\n    \"testing\"\n    \"fmt\"\n)\n\n// Create a function that returns true if the last character\n// of a given string is an alphabetical character and is not\n// a part of a word, and false otherwise.\n// Note: \"word\" is a group of characters separated by space.\n// Examples:\n// >>> check_if_last_char_is_a_letter(\"apple pie\")\n// false\n// >>> check_if_last_char_is_a_letter(\"apple pi e\")\n// true\n// >>> check_if_last_char_is_a_letter(\"apple pi e \")\n// false\n// >>> check_if_last_char_is_a_letter(\"\")\n// false\nfunc check_if_last_char_is_a_letter(txt string) bool {\n"
B = "package check_if_last_char_is_a_letter_test\n\nimport (\n    \"testing\"\n    \"fmt\"\n)\n\n// Create a function that returns true if the last character\n// of a given string is an alphabetical character and is not\n// a part of a word, and false otherwise.\n// Note: \"word\" is a group of characters separated by space.\n// Examples:\n// >>> check_if_last_char_is_a_letter(\"apple pie\")\n// false\n// >>> check_if_last_char_is_a_letter(\"apple pi e\")\n// true\n// >>> check_if_last_char_is_a_letter(\"apple pi e \")\n// false\n// >>> check_if_last_char_is_a_letter(\"\")\n// false\nfunc check_if_last_char_is_a_letter(txt string) bool {\n    // Remove trailing spaces from the string\n    txt = strings.TrimRight(txt, \" \")\n    \n    // Check if the string is empty\n    if len(txt) == 0 {\n        return false\n    }\n    \n    // Get the last character of the string\n    lastChar := txt[len(txt)-1]\n    \n    // Check if the last character is an alphabetical character\n    if !unicode.IsLetter(rune(lastChar)) {\n        return false\n    }\n    \n    // Check if the last character is not part of a word\n    if strings.Contains(txt[:len(txt)-1], \" \") {\n        return true\n    }\n    \n    return false\n}\n\nfunc TestCheckIfLastCharIsALetter(t *testing.T) {\n    tests := []struct {\n        input string\n        want  bool\n    }{\n        {\"apple pie\", false},\n        {\"apple pi e\", true},\n        {\"apple pi e \", false},\n        {\"\", false},\n        {\"hello world\", false},\n        {\"hello world \", false},\n        {\"hello world \", true},\n    }\n    \n    for _, tt := range tests {\n        got := check_if_last_char_is_a_letter(tt.input)\n        if got != tt.want {\n            t.Errorf(\"check_if_last_char_is_a_letter(%q) = %v, want %v\", tt.input, got, tt.want)\n        }\n    }\n}\n"
print(remove_prefix_by_last_line(A, B))