Mr_W1997的博客

class Solution {public: int singleNumber(vector& nums) { int sz = nums.size(); int result = 0; for(int i = 0; i < 32; ++i){ int temp = 1 << i, times = 0;

class Solution {public: ListNode* removeElements(ListNode* head, int val) { while(head && head->val == val) head = head->next; ListNode *p = head; while(p && p

class Solution {private: vector> ans; vector s;public: vector> combinationSum3(int k, int n) { vector visited(10, false); dfs(visited, 1, k, n); return ans; }

class Solution {public: int hammingWeight(uint32_t n) { int count = 0; while (n) { if(n & 1) ++count; n >>= 1; } return cou

ifconfig 查看ip Mac 掩码ifdown 网卡名 禁用网卡ifup 网卡名 启用网卡netstat-t 列出TCP协议端口-u 列出udp协议端口-a 所有-n 不使用域名与服务名 而使用ip与端口号-l 查看监听端口

class Solution {public: int smap[256] = {0}; int tmap[256] = {0}; bool isIsomorphic(string s, string t) { for(int i = 0; i < s.size(); ++i){ if(smap[s[i]] == 0)

class MinStack {public: /** initialize your data structure here. */ stack s; stack sMin; MinStack() { sMin.push(0x7fffffff); } void push(int x) { s.push(x);

class Solution {public: ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { if(0 == headA || headB == 0) return NULL; int len1 = 0, len2 = 0; Lis

class Solution {public: queue s1, s2; int m[256]; int compareVersion(string version1, string version2) { m['0'] = 0; m['1'] = 1;m['2'] = 2;m['3'] = 3;m['4'] = 4; m['5'] =

class Solution {public: bool isHappy(int n) { vector v; long long res = n; v.push_back(res); while(1){ res = getSum(res); if(res == 1)

class Solution {public: int rangeBitwiseAnd(int m, int n) { return n == m ? m : rangeBitwiseAnd(m>>1, n>>1) << 1; }};

class Solution {public: stack s; char str[100]; string convertToTitle(int n) { while(n > 0){ int last = n % 26; s.push(last); n = last==0? n/26

class Solution {public: bool hasCycle(ListNode *head) { if(!head) return false; ListNode *p1 = head, *p2 = head->next; while(p1 && p2){ if(p1 == p2)

class Solution {public: int rob(vector& nums) { if(0 == nums.size()) return 0; if(1 == nums.size()) return nums[0]; if(2 == nums.size())

class Solution {public: queue q; vector ans; vector rightSideView(TreeNode* root) { if(!root) return ans; q.push(root); bfs(); return ans;

class Solution {public: int titleToNumber(string s) { int t = 1; int ans = 0; for(int i = s.size() - 1; i >= 0; --i){ int n = s[i]; n -= 64;

class Solution {public: uint32_t ans = 0; uint32_t reverseBits(uint32_t n) { for(int i = 0; i < 32; ++i){ if(n & (1 << i)){ ans |= (1 << (32 - i -

class Solution {public: void rotate(vector& nums, int k) { if(nums.size() < k) k = k % nums.size(); vector content(k, 0); copy(nums.end() - k, nums.end(), cont

class Solution {public: int findPeakElement(vector& nums) { int sz = nums.size(); if(sz <= 1) return 0; if(nums[0] > nums[1]) return 0; if(nums[sz-1] >

class Solution {public: int ans; int step; stack s; Solution(){ step = 0; } int kthSmallest(TreeNode* root, int k) { TreeNode *p = root; while(p || !s.empty()){ while(p){

class Solution {public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if(!root) return NULL; if(!p) return q; if(!q) return q; TreeNode *r = root; int

class Solution {public: TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) { if(!root || root == p || root == q) return root; TreeNode *left = lowestCommonAncestor(root-

class Solution {public: int countNodes(TreeNode* root) { if(!root) return 0; int hl = 0, hr = 0; TreeNode *l = root, *r = root; while(l){ l = l->left; ++hl; } while(r){

class matrix{private: static const int TOTOP = 0x8; static const int TOBOTTOM = 0x4; static const int TOLEFT = 0x2; static const int TORIGHT = 1; static const int TOMARK = 0x0f; static const in

class Solution {public: vector summaryRanges(vector& nums) { vector ans; int start = 0, ending = 0; for(int i = 0; i < nums.size(); ++i){ start = nums[i]; while(i < nums.size()-1 && n

class Solution {public: int lengthOfLIS(vector& nums) { if(0 == nums.size()) return 0; int maxVal = 1; vector dpVal(nums.size(), 0x80000000); dpVal[0]

class NumArray {public: vector sums; NumArray(vector nums) { sums.push_back(0); for(auto i : nums){ sums.push_back(sums.back()+i); } } int sum

class NumMatrix {public: vector> *sums; NumMatrix(vector> matrix) { if(0 == matrix.size()) return; sums = new vector>(matrix.size(), vector(matrix[0].size(), 0));

class Solution {public: void moveZeroes(vector& nums) { vector notzero(nums.size(), 0); int sz = 0; for(int i = 0; i < nums.size(); ++i){ if(nums[i] != 0)

class Solution {public: int rob(vector& nums) { if(0 == nums.size()) return 0; if(1 == nums.size()) return nums[0]; return max(robLine(nums.begin()

class Solution{public: int maximalSquare(vector > matrix){ if(0 == matrix.size()) return 0; int row = matrix.size(), col = matrix[0].size(); vector> dp(row, vector(col, 0)); int maxn =

// Forward declaration of isBadVersion API.bool isBadVersion(int version);class Solution {public: int firstBadVersion(int n) { long long low = 0, high = n; long long mid;

class Solution {public: deque maxs; vector maxSlidingWindow(vector& nums, int k) { vector ans; for(int i = 0; i < nums.size(); ++i){ if(!maxs.empty() && maxs.front() == i-k) maxs.pop_

class Solution {public: bool containsNearbyDuplicate(vector& nums, int k) { set pot; for(int i = 0; i < nums.size(); ++i){ if(i > k) pot.erase(nums[i-k

class Solution {public: bool containsNearbyAlmostDuplicate(vector& nums, int k, int t) { set pot; for(int i = 0; i < nums.size(); ++i){ long long val = nums[i];

class Solution {public: vector singleNumber(vector& nums) { int res = 0; for(auto i : nums){ res ^= i; } int dif = ((res - 1) & res) ^ res; int a = 0, b = 0; for(auto i : nums){

class Solution {public: int minSubArrayLen(int s, vector& nums) { if(0 == nums.size()) return 0; int l = 0, r = 0, ans = 0x7fffffff; int sum = nums[0];

class Solution {public: static const int VISITING = 0; static const int VISITED = 1; static const int NOTVISITED = 2; bool canFinish(int numCourses, vector>& prerequisites) {

class Solution {public: int missingNumber(vector& nums) { int mark = 0; int maxi = nums.size(); for(int i = 0; i <= maxi; ++i) mark ^= i; for(auto i :

class Solution {public: bool wordPattern(string pattern, string str) { map c2sm; map s2cm; stringstream ss(str); string s; for(int i = 0; i <