actor6

leetcod...

C++(3) 比赛(1)

/ 注册

全部文章 / leetcode(python) （共17篇）

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 ...

2020-11-07

0 447

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...

2020-11-07

0 433

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 a...

2020-11-06

0 479

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...

2020-11-04

0 450

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] 本题比较简单，...

2020-11-04

0 380

leetcode-451 Sort Characters By Frequency

Given a string, sort it in decreasing order based on the frequency of characters. 输入输出实例： Input: "tree" Output: "eert" E...

2020-11-03

0 467

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...

2020-11-03

0 420

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] 本题就是一个简...

2020-11-03

0 385

leetcode-1418 Display Table of Food Orders in a Restaurant

Given the array orders, which represents the orders that customers have done in a restaurant. More specifically orders[i][customerNamei,tableNumberi,f...

2020-11-03

0 505

leetcode-1261 Find Elements in a Contaminated Binary Tree

Given a binary tree with the following rules: root.val == 0 If treeNode.val == x and treeNode.left != null, then treeNode.left.val == 2 * x + 1 If tr...

2020-11-02

0 419