zoukankan      html  css  js  c++  java
  • roblox OA ancestor names 根据roman to int改的

    public class Solution {
        public List<String> sortRoman(List<String> names) {
            List<String> results = new ArrayList<>();
            TreeMap<String, String> sorted_map = new TreeMap<>();
    
            for (String name : names) {
                String digitsName = name.split(" ")[0] + romanToInt(name.split(" ")[1]);
                sorted_map.put(name, digitsName);
            }
    
            for (String name : sorted_map.keySet()) {
                results.add(name);
            }
    
            return results;
        }
    
        public int romanToInt(String s) {
            char[] sc = new char[s.length()];
    
            sc = s.toCharArray();
            int ans = toInt(sc[0]);
            for (int i = 1; i < s.length(); i++) {
                ans += toInt(sc[i]);
                if (toInt(sc[i - 1]) < toInt(sc[i])) {
                    ans -= 2 * toInt(sc[i - 1]);
                }
            }
            return ans;
        }
    
        //toInt
        private int toInt (char s) {
            switch(s) {
                case 'I':return 1;
                case 'V':return 5;
                case 'X':return 10;
                case 'L':return 50;
                case 'C':return 100;
                case 'D':return 500;
                case 'M':return 1000;
            }
            return 0;
        }
    }
  • 相关阅读:
    103
    101
    102
    100
    ByteView和Sink
    二叉排序树删除、搜索、插入的迭代实现
    怎样就地反转单链表?
    有序单链表的合并
    有序数组的合并
    静态表之整型数组的插入、删除、查找
  • 原文地址:https://www.cnblogs.com/immiao0319/p/14163345.html
Copyright © 2011-2022 走看看