cs2wzh-CSDN博客

原创 ImportError: _cffi_backend.cpython-38-x86_64-linux-gnu.so

>>> from notebook.auth import passwd>>> passwd()时报错

2022-11-25 22:58:50 1427 3

原创 [78] 子集

/* * @lc app=leetcode.cn id=78 lang=cpp * * [78] 子集 */// @lc code=startclass Solution {public: vector<vector<int>> subsets(vector<int>& nums) { int n = nums.size(); int bit = 1 << n; vector&lt

2020-08-29 19:00:03 86

/* * @lc app=leetcode.cn id=355 lang=cpp * * [355] 设计推特 */// @lc code=start#include <vector>#include <unordered_set>#include <unordered_map>#include <list>using namespace std;class Twitter { struct Node{ //

2020-08-27 15:23:14 152

原创 [860] 柠檬水找零

/* * @lc app=leetcode.cn id=860 lang=cpp * * [860] 柠檬水找零 */// @lc code=startclass Solution {public: bool lemonadeChange(vector<int>& bills) { int five = 0, ten = 0; for(int it : bills) { if(it == 5)

2020-08-27 15:16:05 78

原创 [859] 亲密字符串

/* * @lc app=leetcode.cn id=859 lang=cpp * * [859] 亲密字符串 */// @lc code=startclass Solution {public: bool buddyStrings(string A, string B) { if(A.size() != B.size()) return false; int n = A.size(); int index =

2020-08-26 21:44:25 254

原创 [621] 任务调度器

/* * @lc app=leetcode.cn id=621 lang=cpp * * [621] 任务调度器 */// @lc code=start#include <vector>bool cmp(int a, int b){ return a > b;}class Solution {public: int leastInterval(vector<char>& tasks, int n) { int

2020-08-26 20:45:41 66

原创 [19] 删除链表的倒数第N个节点

/* * @lc app=leetcode.cn id=19 lang=cpp * * [19] 删除链表的倒数第N个节点 */// @lc code=start// Definition for singly-linked list.// struct ListNode {// int val;// ListNode *next;// ListNode(int x) : val(x), next(NULL) {}// };class Soluti

2020-08-21 14:27:45 109

原创 [45] 跳跃游戏 II

/* * @lc app=leetcode.cn id=45 lang=cpp * * [45] 跳跃游戏 II */// @lc code=startclass Solution {public: int jump(vector<int>& nums) { int ans = 0; int n = nums.size(); int rightmost = 0; int id = 0;

2020-08-20 17:26:10 65

原创 647. 回文子串

647. 回文子串class Solution {public: int countSubstrings(string s) { int n = s.size(); int ans = 0; for(int i = 0; i < 2 * n - 1; ++i){ int l = i / 2; int r = i / 2 + i % 2; while(l >= 0 &

2020-08-19 14:00:08 87

原创 26. 删除排序数组中的重复项

26. 删除排序数组中的重复项–leetcodeclass Solution {public: int removeDuplicates(vector<int>& nums) { if(nums.empty()) return 0; int slow = 0; for(int fast = 0; fast < nums.size(); ++fast){ if(nums[slow] != nums[f

2020-08-18 19:06:31 64

weixin_44827212的博客