如何检查EditText是否包含正确答案?

时间:2018-07-28 10:46:02

标签: java android

我正在进行测验,允许用户在EditText中输入答案。
我的问题是:如何告诉计算机输入的答案是否正确?

2 个答案:

答案 0 :(得分:0)

您的意思是显示错误?

EditText.setError("Your answere is incorrect")

答案 1 :(得分:0)

“编辑文本”格式的回答是定性数据,因此通常不能应用字符串比较,但是如果您有答案来比较句子与句子,则可以在其中使用== 、. equals(),compareTo()和compare() Java,如果您想使用算法并获得结果,则可以将Levenshtein距离与Java-

public class Main {
    public static int getLevenshteinDistances(String s, String t) {
        if (s == null || t == null) {
            throw new IllegalArgumentException("Strings must not be null");
        }
        int n = s.length(); // length of s
        int m = t.length(); // length of t

        if (n == 0) {
            return m;
        } else if (m == 0) {
            return n;
        }

        if (n > m) {
            // swap the input strings to consume less memory
            String tmp = s;
            s = t;
            t = tmp;
            n = m;
            m = t.length();
        }

        int p[] = new int[n + 1]; // 'previous' cost array, horizontally
        int d[] = new int[n + 1]; // cost array, horizontally
        int _d[]; // placeholder to assist in swapping p and d

        // indexes into strings s and t
        int i; // iterates through s
        int j; // iterates through t

        char t_j; // jth character of t

        int cost; // cost

        for (i = 0; i <= n; i++) {
            p[i] = i;
        }

        for (j = 1; j <= m; j++) {
            t_j = t.charAt(j - 1);
            d[0] = j;

            for (i = 1; i <= n; i++) {
                cost = s.charAt(i - 1) == t_j ? 0 : 1;
                // minimum of cell to the left+1, to the top+1, diagonally left
                // and up +cost
                d[i] = Math.min(Math.min(d[i - 1] + 1, p[i] + 1), p[i - 1] + cost);
            }

            // copy current distance counts to 'previous row' distance counts
            _d = p;
            p = d;
            d = _d;
        }

        // our last action in the above loop was to switch d and p, so p now
        // actually has the most recent cost counts
        return p[n];
    }

}