算法求教，ACM 题目指导

public static int symmetry(String source) {  
    int length = source.length();  
    int count = 0;  
    int compareIndex = length - 1;  
    for(int i = 0; i <= compareIndex; i++) {  
        char c = source.charAt(i);  
        char end = source.charAt(compareIndex);  
        if(c == end) {  
            compareIndex--;  
            continue;  
        } else {  
            count++;  
        }  
    }  
    return count;  
}

循环的地方改成： for(int i = 0; i <= compareIndex; i++) 就可以满足了