xiaxingyi的博客

二分法leetcode 410、875、774public int minEatingSpeed(int[] piles, int H) { int left = 1; int right = Integer.MIN_VALUE; for(int i=0;i<piles.length;i++){ //left = Math.min(left,piles[i]); right = Math.max(ri

java中哈希表的使用第二例—即将罗马数字转换为整数代码：class Solution {public int romanToInt(String s) {HashMap<Character,Integer> map = new HashMap<Character,Integer>();map.put(‘I’,1);map.put(‘V’,5);map.put(‘X’,10);map.put(‘L’,50);map.put(‘C’,100);map.put(‘D’