actor_spider

DRkJNAzxAG

摘要：验证阅读全文

posted @ 2020-11-11 22:03 actor_spider 阅读(51) 评论(0) 推荐(0)

指针常量和常量指针

摘要：指针常量(const int *ptr)：指针所指向的对象是一个常量，无法通过访问该指针来改变该对象的值，但是我们可以通过其他方式去改变该对象，比如直接改变该对象的值。 #include<iostream>int main() { int i = 42; int *r1 = &i; const i 阅读全文

posted @ 2020-11-09 09:34 actor_spider 阅读(108) 评论(0) 推荐(0)

leetcode-508 Most Frequent Subtree Sum

摘要： Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values 阅读全文

posted @ 2020-11-07 17:17 actor_spider 阅读(59) 评论(0) 推荐(0)

leetcode-609 Find Duplicate File in System

摘要： Given a list of directory info including directory path, and all the files with contents in this directory, you need to find out all the groups of dup 阅读全文

posted @ 2020-11-07 16:17 actor_spider 阅读(102) 评论(0) 推荐(0)

leetcode-895 Maximum Frequency Stack

摘要： Implement FreqStack, a class which simulates the operation of a stack-like data structure. FreqStack has two functions: push(int x), which pushes an i 阅读全文

posted @ 2020-11-06 10:59 actor_spider 阅读(125) 评论(0) 推荐(0)

leetcode-1072 Flip Columns For Maximum Number of Equal Rows

摘要： Given a matrix consisting of 0s and 1s, we may choose any number of columns in the matrix and flip every cell in that column. Flipping a cell changes 阅读全文

posted @ 2020-11-04 20:16 actor_spider 阅读(101) 评论(0) 推荐(0)

leetcode-347 Top K Frequent Elements

摘要： Given a non-empty array of integers, return the k most frequent elements. 输入输出实例： Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] 本题比较简单，就输出出现的最频繁的k个阅读全文

posted @ 2020-11-04 19:37 actor_spider 阅读(53) 评论(0) 推荐(0)

leetcode-451 Sort Characters By Frequency

摘要： Given a string, sort it in decreasing order based on the frequency of characters. 输入输出实例： Input: "tree" Output: "eert" Explanation: 'e' appears twice 阅读全文

posted @ 2020-11-03 21:00 actor_spider 阅读(97) 评论(0) 推荐(0)

leetcode-739 Daily Temperatures

摘要： Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warme 阅读全文

posted @ 2020-11-03 20:39 actor_spider 阅读(64) 评论(0) 推荐(0)

leetcode-94 Binary Tree Inorder Traversal

摘要： Given the root of a binary tree, return the inorder traversal of its nodes' values. 示例： Input: root = [1,null,2,3] Output: [1,3,2] 本题就是一个简单的中序遍历二叉树 1 阅读全文

posted @ 2020-11-03 19:46 actor_spider 阅读(58) 评论(0) 推荐(0)

公告

2020年11月11日

DRkJNAzxAG

2020年11月9日

指针常量和常量指针

2020年11月7日