Simple manual implementation of map

package redisprc.test;

import java.util.*;
/** * @Author lijiaxin * @Description TODO * @Date 2022/07/27/15:55 * @Version 1.0 */
public class myMap<K, V> {
    
    private Node<K,V>[] nodes;
    private int size;
    private static class Node<K,V> {
    
        K key;
        V value;
        Node(K key,V value){
    
            this.key = key;
            this.value = value;
        }
    }
    public void put(K key,V value){
    
    if(nodes == null){
    
        nodes = new Node[10];
        }
    int index = indexOfkey(key);
    if (index!=-1){
    
        nodes[index].value = value;
    }else {
    
        nodes[size] = new Node<K, V>(key,value);
        size++;
        }
    }

    private int indexOfkey(K key){
    
        for (int index = 0; index < size; index++) {
    
            if (key.equals(this.nodes[index].key)){
    
                return index;
            }
        }
        return -1;
    }
    public V get(K key){
    
        int index = indexOfkey(key);
        if (index!=-1){
    
            return nodes[index].value;
        }
        return null;
    }
    public int size(){
    
        return size;
    }
}