摘要: 思路:小的在左就去减,大的就加。 public int romanToInt(String s){ int preNum= getValue(s.charAt(0)); int num=0; int sum=0; for(int i=1;i<s.length();i++){ num=getValue 阅读全文
posted @ 2020-08-30 13:59 huxiaojie 阅读(107) 评论(0) 推荐(0) 编辑
摘要: 思路:贪心算法:及考虑当前步骤最大利益。 解法: int[] values={1000,900,500,400,100,90,50,40,10,9,5,4,1}; String[] symbols={"M","CM","D","CD","C","XC","L","XL","X","IX","V"," 阅读全文
posted @ 2020-08-30 11:04 huxiaojie 阅读(154) 评论(0) 推荐(0) 编辑
摘要: 题目描述: 解法一:暴力解法 class Solution { public int maxArea(int[] height) { int Area=0; int max=0; ArrayList<Integer> Arealist = new ArrayList<>(); for(int idx 阅读全文
posted @ 2020-08-30 02:17 huxiaojie 阅读(147) 评论(0) 推荐(0) 编辑