Idea无敌巨好用快捷键

Idea快捷键

所有的快捷键都在这里设置

最最最最基础快捷键

Ctrl + F 和 Alt + F3 在文件中查找

右方可以设置忽略大小写查找等设置

在你看我这篇氵文的时候，你肯定会想：~~写的这么好，点赞👍➕关注，扣老铁666，骗更多人来👀~~ ，打开你的Idea ，创建项目，和我一起来试一下。

项目代码

java 复制代码

import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;

public class Main {
    public static void main(String[] args) {
        // LinkedHashMap<String, String> map1 = new LinkedHashMap<>();
        // map1.put("a", "2");
        // map1.put("g", "3");
        // map1.put("r", "1");
        // map1.put("e", "23");
        // for (Map.Entry < String, String > entry: map1.entrySet()) {
        //     System.out.println(entry.getKey() + ":" + entry.getValue());
        // }
        // System.out.println("----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
        // LinkedHashMap<Integer, String> map = new LinkedHashMap<>(16, 0.75f, true);
        // map.put(1, "one");
        // map.put(2, "two");
        // map.put(3, "three");
        // map.put(4, "four");
        // map.put(5, "five");
        // //访问元素2,该元素会被移动至链表末端
        // map.get(2);
        // //访问元素3,该元素会被移动至链表末端
        // map.get(3);
        // map.forEach((k, v) -> System.out.println(k + ":" + v));
        // System.out.println("----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
        LRUCache<Integer, String> cache = new LRUCache<>(3);
        cache.put(1, "one");
        cache.put(2, "two");
        cache.put(3, "three");
        cache.put(4, "four");
        cache.put(5, "five");
        for (int i = 1; i <= 5; i++) {
            System.out.println(cache.get(i));
        }


    }
}

java 复制代码

import java.util.LinkedHashMap;
import java.util.Map;

public class LRUCache<K, V> extends LinkedHashMap<K, V> {
    private final int capacity;

    public LRUCache(int capacity) {
        super(capacity, 0.75f, true);
        this.capacity = capacity;
    }

    /**
     * 判断size超过容量时返回true，告知LinkedHashMap移除最老的缓存项(即链表的第一个元素)
     */
    @Override
    protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
        return size() > capacity;
    }
}

对这块代码感兴趣的同学可以去看我的另一篇文章：LinkedHashMap 源码剖析 - 掘金 (juejin.cn) 如果你只有一个显示器的话，那么你就可以使用 Alt + Tab在看文章的同时，并且随时快速切换到自己的项目进行调试。