Fork me on GitHub
打赏
2021年2月6日
LeetCode-13. Roman to Integer | 罗马数字转整数
摘要： 题目 LeetCode 力扣 题解 先维护一个map，用于建立罗马数字和整数的关系，接着挨个破译即可。 //Go func romanToInt(s string) int { var charToIntMap = make(map[byte]int, 8) charToIntMap['I'] = 阅读全文
posted @ 2021-02-06 21:45 Zoctopus_Zhang 阅读(54) 评论(0) 推荐(0)
LeetCode-14. Longest Common Prefix | 最长公共前缀
摘要： 题目 LeetCode LeetCode-cn Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an 阅读全文
posted @ 2021-02-06 21:43 Zoctopus_Zhang 阅读(95) 评论(0) 推荐(0)
// function btn_donateClick() { var DivPopup = document.getElementById('Div_popup'); var DivMasklayer = document.getElementById('div_masklayer'); DivMasklayer.style.display = 'block'; DivPopup.style.display = 'block'; var h = Div_popup.clientHeight; with (Div_popup.style) { marginTop = -h / 2 + 'px'; } } function MasklayerClick() { var masklayer = document.getElementById('div_masklayer'); var divImg = document.getElementById("Div_popup"); masklayer.style.display = "none"; divImg.style.display = "none"; } setTimeout( function () { document.getElementById('div_masklayer').onclick = MasklayerClick; document.getElementById('btn_donate').onclick = btn_donateClick; var a_gzw = document.getElementById("guanzhuwo"); a_gzw.href = "javascript:void(0);"; $("#guanzhuwo").attr("onclick","follow('33513f9f-ba13-e011-ac81-842b2b196315');"); }, 900);