HashTable - homework

package hashTable;

public class HashTable {

    public int hash(String s) {
        int result=0;

        for (int i=0; i<s.length(); i++) {
            result += s.charAt(i);
        }

        return result;
    }

    class HashTableItem {
        String key;
        String value;
        HashTableItem next;
        public HashTableItem(String k, String v, HashTableItem n) {
            key=k; value=v; next=n;
        }
    }

    HashTableItem array[];

    public HashTable(int capacity) {
        array=new HashTableItem[capacity];
    }

    public void put(String key, String value) {
        int index = hash(key) % array.length;
        HashTableItem newdata = new HashTableItem(key, value, array[index]);
/*      newdata.key = key;
        newdata.value = value;
        newdata.next = array[index];
*/
        array[index] = newdata;
    }

    public String get(String key) {
        int index = hash(key)  % array.length;
        HashTableItem item=array[index];
        while (item!=null && !item.key.equals(key))
            item = item.next;

/*      for (HashTableItem item=array[index]; item!=null && !item.key.equals(key);
                item = item.next);
*/
        if (item==null) return null;
        else return item.value;

    }

    public void remove(String key) {
        // TODO: this is your homework...
    }
}