weixin_40667201的博客

写一个自认为最快的遍历一次hash的方法吧。import java.util.HashMap;import java.util.Map;public class Solution { public int[] twoSum(int[] nums,int target){ Map<Integer,Integer> map=new HashMap<>(); int[] result=new int[2]; for(int

public boolean isPalindromic(String s) { int len = s.length(); for (int i = 0; i < len / 2; i++) { if(s.charAt(i)!=s.charAt(len-1-i)){ return false; } } return true;}public String longestPalindrome(String .

public class LRUCache extends LinkedHashMap <Integer,Integer>{ private int capacity; public LRUCache(int capacity){ super(capacity,0.75f,true); this.capacity=capacity; } public int get(int key){ return super..