设某个一维数组中有25个元素,编写一个顺序查找程序,从中查找值为x的元素在数组中的位置..

Question

用java 编 详细步骤~！
急 下午之前解答有效

Answer 1

public static void main(String[] args) {
int[] res = {1,2,5,6,7,8,9,3,10,11,12,14,15,22,21,17,86,99,55,24,23,25,28,31,65};
int length = res.length;
int j = 25;
for (int i = 0; i < length; i++) {
if(res[i] == j) {
System.out.println("位于数组：" + i);
}
}
}

Answer 2

/**
 * 索引器
 * @author Hardneedl
 */
interface Index<T,V> {
    T getIndex(V v);
}

/**
 * @author Hardneedl
 */
public class IndexDemo {
    /**
     * 索引器的实现者
     */
    static final private class _Index implements Index<Integer,Comparable>{
        private Object[]a;
        private void setArray(Object[]a){
            this.a=a;
        }
        public Integer getIndex(Comparable comparable) {
            for(int i = 0,j=a.length;i<j;i++){
                if (a[i].equals(comparable))
                    return i;
            }
            return -1;
        }
    }
    public static void main(String... args) {
        Object[]datas=new Object[]{3,"asdfasdf","fdafd","4","5","a3d"};
        _Index index = new _Index();
        index.setArray(datas);
        System.out.println(index.getIndex("4"));
    }
}

Answer 3

这个是哪方面的？数学的、？还是电脑的？？？追问

没看到是java吗 不要来瞎凑热闹了