随笔分类 -  leetcode

摘要://787. K 站中转内最便宜的航班 var findCheapestPrice = function (n, flights, src, dst, K) { //把出和入存到map //key为dst,value为[src, cost] const innerMap = new Map(); / 阅读全文
posted @ 2020-11-08 21:31 想学JS的前端 阅读(125) 评论(0) 推荐(0)
摘要:var letterCombinations = function(digits) { if (!digits || digits ' ') return [] let alpList = ['abc','def','ghi','jkl','mno','pqrs','tuv','wxyz'] let 阅读全文
posted @ 2020-04-16 18:12 想学JS的前端 阅读(154) 评论(0) 推荐(0)
摘要:var intToRoman = function(num) { let res = '' const numArr = [1000,900,500,400,100,90,50,40,10,9,5,4,1] const strArr = ['M','CM','D', 'CD','C','XC','L 阅读全文
posted @ 2020-04-14 21:12 想学JS的前端 阅读(156) 评论(0) 推荐(0)
摘要:var romanToInt = function(s) { var hashMap = { 'M': 1000, 'D': 500, 'C': 100, 'L': 50, 'X': 10, 'V': 5, 'I': 1 }; var num = 0; for(var i = 0; i < s.le 阅读全文
posted @ 2020-04-14 17:07 想学JS的前端 阅读(150) 评论(0) 推荐(0)