01 2024 档案
摘要:https://www.yangdx.com/2022/07/215.html 辅助看 https://blog.csdn.net/weixin_42081389/article/details/132127613 git fetch origin --tags git reset --hard 版
阅读全文
摘要:https://blog.csdn.net/weixin_45502414/article/details/130151842
阅读全文
摘要:/* * @lc app=leetcode.cn id=225 lang=cpp * * [225] 用队列实现栈 */ // @lc code=start class MyStack { public: MyStack() { q1 = new queue<int>; q2 = new queue
阅读全文
摘要:/* * @lc app=leetcode.cn id=232 lang=cpp * * [232] 用栈实现队列 */ // @lc code=start class MyQueue { public: MyQueue() { } void push(int x) { s1.push(x); }
阅读全文
摘要:/* * @lc app=leetcode.cn id=150 lang=cpp * * [150] 逆波兰表达式求值 */ // @lc code=start class Solution { public: int calc(int left, int right, char sign) { s
阅读全文
摘要:/* * @lc app=leetcode.cn id=20 lang=cpp * * [20] 有效的括号 */ // @lc code=start class Solution { public: bool isValid(string s) { stack<char> cs; for (cha
阅读全文
摘要:/* * @lc app=leetcode.cn id=61 lang=cpp * * [61] 旋转链表 */ // @lc code=start /** * Definition for singly-linked list. * struct ListNode { * int val; * L
阅读全文
摘要:/* * @lc app=leetcode.cn id=19 lang=c * * [19] 删除链表的倒数第 N 个结点 */ // @lc code=start /** * Definition for singly-linked list. * struct ListNode { * int
阅读全文
摘要:/* * @lc app=leetcode.cn id=27 lang=c * * [27] 移除元素 */ // @lc code=start int removeElement(int *nums, int numsSize, int val) { int *p = nums; int *q =
阅读全文
摘要:adom = document.createElement('audio'); pt = adom.canPlayType("audio/ogg; codecs=\"vorbis\""); pt2 = adom.canPlayType("audio/wav; codecs=\"1\""); pt3
阅读全文
摘要:cdom = document.createElement('canvas'); cdom.width = 200; cdom.height = 50; c2d = cdom.getContext('2d'); c2d.textBaseline = 'top'; c2d.font = "18px '
阅读全文
摘要:div = document.createElement('div'); div.style.visibility = 'hidden'; div.innerHTML = '<span lang="zh" style="font-family:mmllii;font-size:114px">mmmm
阅读全文