ababy1024的博客

13. 罗马数字转整数class Solution {public: int romanToInt(string s) { unordered_map<char, int> hash; hash['I'] = 1, hash['V'] = 5; hash['X'] = 10, hash['L'] = 50; hash['C'] = 100, hash['D'] = 500; hash['M'] =

12. 整数转罗马数字cpp code:class Solution {public: string intToRoman(int num) { int values[] = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 }; string unit[] = {

leetcode11盛水最多的容器class Solution {public: int maxArea(vector<int>& height) { int ans = 0 ; for (int i = 0, j = height.size() - 1; i < j;) { ans = max(ans, min(height[i],height[j]) * (j - i));

contentcodeclass Solution {public: vector<string> ans; vector<string> generateParenthesis(int n) { dfs(n, 0, 0, ""); return ans; } void dfs(int n, int lc, int rc, string sec) { if (lc == n &&a

class Solution {public: bool isValid(string s) { stack<char> stk; for (char c : s) { if (c == '{' || c == '(' || c == '[') { stk.push(c); } else { .

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * ListNode(int x) : val(x), next(nullptr) {} * ListNode(int x, ListNode *next) : val(x), next(next.