LeetCode
文章平均质量分 76
cyberickk
这个作者很懒,什么都没留下…
展开
-
LeetCode 537 Complex Number Multiplication
537 Complex Number Multiplicationhttps://leetcode.com/problems/complex-number-multiplication/A complex number can be represented as a string on the form "**real**+**imaginary**i" where:real is the real part and is an integer in the range [-100, 100].原创 2021-08-25 20:26:42 · 113 阅读 · 0 评论 -
LeetCode 1402 Reducing Dishes
1402. Reducing Disheshttps://leetcode.com/problems/reducing-dishes/A chef has collected data on the satisfaction level of his n dishes. Chef can cook any dish in 1 unit of time.Like-time coefficient of a dish is defined as the time taken to cook that d原创 2021-07-11 16:10:23 · 190 阅读 · 0 评论 -
LeetCode 1338 Reduce Array Size to The Half
1338 Reduce Array Size to The Halfhttps://leetcode.com/problems/reduce-array-size-to-the-half/Given an array arr. You can choose a set of integers and remove all the occurrences of these integers in the array.Return the minimum size of the set so that原创 2021-07-06 16:52:38 · 143 阅读 · 0 评论 -
LeetCode 556 Reshape the Matrix
556 Reshape the Matrixhttps://leetcode.com/problems/reshape-the-matrix/In MATLAB, there is a handy function called reshape which can reshape an m x n matrix into a new one with a different size r x c keeping its original data.You are given an m x n matr原创 2021-07-05 15:23:33 · 69 阅读 · 0 评论 -
LeetCode 142 Linked List Cycle II
142 Linked List Cycle IIhttps://leetcode.com/problems/linked-list-cycle-ii/Given a linked list, return the node where the cycle begins. If there is no cycle, return null.There is a cycle in a linked list if there is some node in the list that can be rea原创 2021-05-31 11:14:38 · 142 阅读 · 0 评论 -
LeetCode 287 Find the Duplicate Number
287 Find the Duplicate Numberhttps://leetcode.com/problems/find-the-duplicate-number/Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive.There is only one repeated number in nums, return this re原创 2021-05-30 22:02:42 · 95 阅读 · 0 评论 -
LeetCode 1689 Partitioning Into Minimum Number Deci-Binary
1689 Partitioning Into Minimum Number Of Deci-Binary Numbershttps://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. Fo原创 2021-05-27 10:53:44 · 94 阅读 · 0 评论 -
LeetCode 1048 Longest String Chain
1048 Longest String Chainhttps://leetcode.com/problems/longest-string-chain/Given a list of words, each word consists of English lowercase letters.Let’s say word1 is a predecessor of word2 if and only if we can add exactly one letter anywhere in word1 t原创 2021-05-18 10:35:34 · 108 阅读 · 0 评论 -
LeetCode 1423 Maximum Points You Can Obtain from Cards
1423 Maximum Points You Can Obtain from Cardshttps://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/There are several cards arranged in a row, and each card has an associated number of points The points are given in the integer array card原创 2021-05-12 14:50:10 · 84 阅读 · 0 评论 -
LeetCode 204 Count Primes
204 Count Primeshttps://leetcode.com/problems/count-primes/Count the number of prime numbers less than a non-negative number, n.Example 1:Input: n = 10Output: 4Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.Example 2:Inpu原创 2021-05-10 21:25:59 · 105 阅读 · 0 评论 -
LeetCode 509 Fibonacci Number
509 Fibonacci Numberhttps://leetcode.com/problems/fibonacci-number/The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0and 1. That is,F(0原创 2021-04-15 20:45:18 · 75 阅读 · 0 评论 -
LeetCode 1302 Deepest Leaves Sum
1302 Deepest Leaves Sumhttps://leetcode.com/problems/deepest-leaves-sum/Given the root of a binary tree, return the sum of values of its deepest leaves.Example 1:Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]Output: 15Example 2:Input: ro原创 2021-04-12 14:48:16 · 116 阅读 · 0 评论 -
LeetCode 1704 Determine if String Halves Are Alike
1704 Determine if String Halves Are Alikehttps://leetcode.com/problems/determine-if-string-halves-are-alike/You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half.原创 2021-04-07 21:58:20 · 96 阅读 · 0 评论 -
LeetCode 1551 Minimum Operations to Make Array Equal
1551 Minimum Operations to Make Array Equalhttps://leetcode.com/problems/minimum-operations-to-make-array-equal/You have an array arr of length n where arr[i] = (2 * i) + 1 for all valid values of i (i.e. 0 <= i < n).In one operation, you can sele原创 2021-04-07 10:29:01 · 123 阅读 · 0 评论 -
LeetCode 775 Global and Local Inversions
775 Global and Local Inversionshttps://leetcode.com/problems/global-and-local-inversions/We have some permutation A of [0, 1, ..., N - 1], where N is the length of A.The number of (global) inversions is the number of i < j with 0 <= i < j <原创 2021-04-06 10:27:27 · 105 阅读 · 0 评论 -
LeetCode 1615 Maximal Network Rank
1615 Maximal Network Rankhttps://leetcode.com/problems/maximal-network-rank/There is an infrastructure of n cities with some number of roads connecting these cities. Each roads[i] = [ai, bi] indicates that there is a bidirectional road between cities ai原创 2021-03-18 22:44:37 · 256 阅读 · 0 评论 -
LeetCode 1721 Swapping Nodes in a Linked List 每日一题 20210315
1721 Swapping Nodes in a Linked ListYou are given the head of a linked list, and an integer k.Return the head of the linked list after swapping the values of the kth node from the beginning and the kth node from the end (the list is 1-indexed).Example 1原创 2021-03-15 09:49:56 · 113 阅读 · 0 评论 -
LeetCode 399 Evaluate Division
399 Evaluate Divisionhttps://leetcode.com/problems/evaluate-division/You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i]represent the equation Ai / Bi = values[i]. Each Ai or原创 2021-03-03 10:37:11 · 80 阅读 · 0 评论 -
LeetCode 1267 Count Servers that Communicate
1267 Count Servers that Communicatehttps://leetcode.com/problems/count-servers-that-communicate/You are given a map of a server center, represented as a m * ninteger matrix grid, where 1 means that on that cell there is a server and 0 means that it is no原创 2021-02-24 22:30:28 · 85 阅读 · 0 评论 -
LeetCode 1387 Sort Integers by The Power Value
1387 Sort Integers by The Power ValueThe power of an integer x is defined as the number of steps needed to transform x into 1 using the following steps:if x is even then x = x / 2if x is odd then x = 3 * x + 1For example, the power of x = 3 is 7 beca原创 2021-02-24 11:53:42 · 136 阅读 · 0 评论 -
LeetCode 841 Keys and Rooms
841 Keys and RoomsThere are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, ..., N-1, and each room may have some keys to access the next room.Formally, each room i has a list of keys rooms[i], and each key rooms[i][j] is an原创 2021-02-24 11:51:05 · 82 阅读 · 0 评论 -
LeetCode 1557 Minimum Number of Vertices to Reach All Nodes
1557 Minimum Number of Vertices to Reach All NodesGiven a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to node toi.Find the smallest set of ver原创 2021-02-20 22:44:59 · 175 阅读 · 0 评论 -
LeetCode 997 Find the Town Judge
997 Find the Town Judgehttps://leetcode.com/problems/find-the-town-judge/In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is secretly the town judge.If the town judge exists, then:The town judge trusts nobo原创 2021-02-01 17:48:39 · 106 阅读 · 0 评论 -
剑指offer 面试题06. 从尾到头打印链表
面试题06. 从尾到头打印链表输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。示例 1:输入:head = [1,3,2]输出:[2,3,1]限制:0 <= 链表长度 <= 10000解法一遍历链表,把元素依次存入 vector,最后调用 algorithm::reverse 逆转即可遍历链表并存入 vector 的时间复杂度 O(n),逆转共需进行 n/2 次交换,总的时间复杂度 O(n),空间复杂度 O(1) ,题目要求的 vector 空间不算在内/原创 2020-06-09 10:03:32 · 160 阅读 · 0 评论 -
剑指offer 面试题04. 二维数组中的查找
面试题04. 二维数组中的查找在一个 n * m 的二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。请完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该整数。示例:现有矩阵 matrix 如下:[[1, 4, 7, 11, 15],[2, 5, 8, 12, 19],[3, 6, 9, 16, 22],[10, 13, 14, 17, 24],[18, 21, 23, 26, 30]]给定 target = 5,返原创 2020-06-06 22:41:54 · 199 阅读 · 0 评论 -
剑指offer 面试题05. 替换空格
面试题05. 替换空格请实现一个函数,把字符串 s 中的每个空格替换成"%20"。示例 1:输入:s = “We are happy.”输出:“We%20are%20happy.”限制:0 <= s 的长度 <= 10000解法一遍历字符串,碰到空格时空格本身的位置替换为 ‘%’,并在之后插入 “20”因为插入的过程是把字符串中的字符向后移动,所以时间复杂度为 O(n),总的时间复杂度 O(n^2),空间复杂度 O(1)class Solution {public:原创 2020-06-05 22:55:10 · 107 阅读 · 0 评论 -
剑指offer 面试题03. 数组中重复的数字
面试题03. 数组中重复的数字找出数组中重复的数字。在一个长度为 n 的数组 nums 里的所有数字都在 0~n-1 的范围内。数组中某些数字是重复的,但不知道有几个数字重复了,也不知道每个数字重复了几次。请找出数组中任意一个重复的数字。示例 1:输入:[2, 3, 1, 0, 2, 5, 3]输出:2 或 3 限制:2 <= n <= 100000解法一 set辅助用 set 记录元素,遍历时查找是否出现过,出现过则返回,否则插入 set 中时间复杂度 O(n),空间原创 2020-06-04 23:24:45 · 85 阅读 · 0 评论 -
剑指offer 面试题11. 旋转数组的最小数字
面试题11. 旋转数组的最小数字把一个数组最开始的若干个元素搬到数组的末尾,我们称之为数组的旋转。输入一个递增排序的数组的一个旋转,输出旋转数组的最小元素。例如,数组 [3,4,5,1,2] 为 [1,2,3,4,5] 的一个旋转,该数组的最小值为1。示例 1:输入:[3,4,5,1,2]输出:1示例 2:输入:[2,2,2,0,1]输出:0注意:本题与主站 154 题相同:https://leetcode-cn.com/problems/find-minimum-in-rotated-so原创 2020-06-04 23:23:35 · 141 阅读 · 0 评论 -
剑指offer 面试题15. 二进制中1的个数
面试题15. 二进制中1的个数请实现一个函数,输入一个整数,输出该数二进制表示中 1 的个数。例如,把 9 表示成二进制是 1001,有 2 位是 1。因此,如果输入 9,则该函数输出 2。示例 1:输入:00000000000000000000000000001011输出:3解释:输入的二进制串 00000000000000000000000000001011 中,共有三位为 ‘1’。示例 2:输入:00000000000000000000000010000000输出:1解释:输入的二进原创 2020-06-04 23:22:23 · 145 阅读 · 0 评论 -
LeetCode1025 Divisor Game
1025 Divisor GameAlice and Bob take turns playing a game, with Alice starting first.Initially, there is a number N on the chalkboard. On each player’s turn, that player makes a move consisting of:Choosing any x with 0 < x < N and N % x == 0.Repl原创 2020-05-30 16:44:41 · 141 阅读 · 0 评论