leetcode
文章平均质量分 77
white_156
星河滚烫,烫死人间理想;
皓月星辰 冻死人间曙光
展开
-
July leetcoding Challenge 2021
传送门初版待优化class Solution {public: vector<int> ans; vector<int> grayCode(int n) { int lim = 1<<n; vector<bool> vis(lim,false); vector<vector<int> > adj; for(int i=0;i<l原创 2021-10-06 15:18:47 · 161 阅读 · 0 评论 -
Leetcode Single Number 全家桶
Single Number题目描述给出一个数组,数组中只有一个数字只出现了一次,其余数字都出现了两次,求这个只出现了一次的数字解题思路这里我们用到位运算异或^的特性a ^ a = 0和0 ^ a = a不难看出仅需要O(n)的时间内就可以解出答案,代码如下:class Solution { public int singleNumber(int[] nums) { int ans = 0; for(int i=0;i<nums.length;i++)原创 2020-07-25 00:49:52 · 170 阅读 · 0 评论 -
链表中环的入口结点
给一个链表,若其中包含环,请找出该链表的环的入口结点,否则,输出null。首先建立两个指针slow和fast都指向头指针,指针slow步长为1,fast步长为2。如果slow和fast在非空结点相遇,那么链表一定有环。记len为环的长度,假设fast比slow提前x步进入环,y步之后两指针相遇相遇前,fast走了2x+2y距离,slow走了y距离。相遇问题转化为求解这个同余方程。又因为slow步长为1,因此此方程必有解。所以用这种快慢指针的方式是可以检测是否存在环的。此外,n必然是环长度len的原创 2020-07-20 16:24:09 · 175 阅读 · 0 评论 -
Leetcode周赛 1521. Find a Value of a Mysterious Function Closest to Target
吹雪❣俺は嫁た。いつもいつも大好き 求abs(arr[l]&arr[l+1]⋯&arr[r]−target) abs( arr[l] \& arr[l+1] \cdots \&arr[r] - target) abs(arr[l]&arr[l+1]⋯&arr[r]−target)最小值先贴一个思路很棒的优化,充分利用单调不增的性质记AND(l,r)表示arr[l]&arr[l+1]⋯&arr[r]arr[l] \&.原创 2020-07-19 22:40:40 · 296 阅读 · 0 评论 -
leetcode 数据库练习
IT camps 链接原创 2019-12-07 20:18:03 · 158 阅读 · 0 评论 -
leetcode 738. Monotone Increasing Digits
Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.(Recall that an integer has monotone increasing digits if and only if each pair...原创 2018-10-17 08:42:26 · 208 阅读 · 0 评论 -
leetcode 926. Flip String to Monotone Increasing
A string of '0’s and '1’s is monotone increasing if it consists of some number of '0’s (possibly 0), followed by some number of '1’s (also possibly 0.)We are given a string S of '0’s and '1’s, and we...原创 2018-10-22 13:02:51 · 214 阅读 · 0 评论 -
leetcode 928. Minimize Malware Spread II
In a network of nodes, each node i is directly connected to another node j if and only if graph[i][j] = 1.Some nodes initial are initially infected by malware. Whenever two nodes are directly connec...原创 2018-10-23 16:19:26 · 706 阅读 · 0 评论 -
leetcode 936. Stamping The Sequence
You want to form a target string of lowercase letters.At the beginning, your sequence is target.length ‘?’ marks. You also have a stamp of lowercase letters.On each turn, you may place the stamp ov...原创 2018-11-05 13:42:05 · 679 阅读 · 1 评论 -
leetcode 939. Minimum Area Rectangle
Given a set of points in the xy-plane, determine the minimum area of a rectangle formed from these points, with sides parallel to the x and y axes.If there isn’t any rectangle, return 0.Example 1:I...原创 2018-11-27 00:21:18 · 217 阅读 · 0 评论 -
leetcode974. Subarray Sums Divisible by K
Given an array A of integers, return the number of (contiguous, non-empty) subarrays that have a sum divisible by K.Example 1:Input: A = [4,5,0,-2,-3,1], K = 5Output: 7Explanation: There are 7 sub...原创 2019-01-20 20:26:22 · 192 阅读 · 1 评论 -
leetcode978 Longest Turbulent Subarray
A subarray A[i], A[i+1], …, A[j] of A is said to be turbulent if and only if:For i &lt;= k &lt; j, A[k] &gt; A[k+1] when k is odd, and A[k] &lt; A[k+1] when k is even;OR, for i &lt;= k &lt; j, A[k] ...原创 2019-01-25 20:58:52 · 258 阅读 · 0 评论 -
leetcode 940. Distinct Subsequences II
Given a string S, count the number of distinct, non-empty subsequences of S .Since the result may be large, return the answer modulo 10^9 + 7.Example 1:Input: "abc"Output: 7Explanation: The 7 dis...原创 2019-02-04 20:31:18 · 195 阅读 · 0 评论 -
Leetcode 943. Find the Shortest Superstring
Given an array A of strings, find any smallest string that contains each string in A as a substring.We may assume that no string in A is substring of another string in A.Example 1:Input: [“alex”,“l...原创 2019-03-29 16:40:59 · 579 阅读 · 0 评论 -
leetcode 924. Minimize Malware Spread
In a network of nodes, each node i is directly connected to another node j if and only if graph[i][j] = 1.Some nodes initial are initially infected by malware. Whenever two nodes are directly connec...原创 2018-10-16 16:42:22 · 636 阅读 · 0 评论 -
leetcode 918. Maximum Sum Circular Subarray
Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C.Here, a circular array means the end of the array connects to the beginning of the ar...原创 2018-10-09 21:39:00 · 1134 阅读 · 0 评论 -
leetcode 20. Valid Parentheses
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of b...原创 2018-09-02 22:09:38 · 73 阅读 · 0 评论 -
leetcode 264. Ugly Number II
Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. Example:Input: n = 10Output: 12Explanation: 1, 2, 3, 4, 5, 6, 8, 9, 10,...原创 2018-09-05 21:56:50 · 87 阅读 · 0 评论 -
leetcode 310. Minimum Height Trees
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called mini...原创 2018-09-09 15:45:55 · 103 阅读 · 0 评论 -
leetcode 685. Redundant Connection II 冗余连接
In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, excep...原创 2018-09-16 21:10:16 · 314 阅读 · 0 评论 -
leetcode 167. Two Sum II - Input array is sorted
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers ...原创 2018-09-16 21:55:29 · 117 阅读 · 0 评论 -
leetcode 207. Course Schedule
There are a total of n courses you have to take, labeled from 0 to n-1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair...原创 2018-09-10 14:32:30 · 99 阅读 · 0 评论 -
leetcode 101. Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3B...原创 2018-09-10 14:58:37 · 111 阅读 · 0 评论 -
leetcode 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array....原创 2018-09-17 17:34:58 · 92 阅读 · 0 评论 -
leetocde 904. Fruit Into Baskets
In a row of trees, the i-th tree produces fruit with type tree[i].You start at any tree of your choice, then repeatedly perform the following steps:Add one piece of fruit from this tree to your ba...原创 2018-09-18 16:29:59 · 590 阅读 · 0 评论 -
765. Couples Holding Hands
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing any two people...原创 2018-10-11 21:33:57 · 124 阅读 · 0 评论 -
leetcode 861. Score After Flipping Matrix
We have a two dimensional matrix A where each value is 0 or 1.A move consists of choosing any row or column, and toggling each value in that row or column: changing all 0s to 1s, and all 1s to 0s.Af...原创 2018-10-12 21:46:30 · 149 阅读 · 0 评论 -
letcode 714. Best Time to Buy and Sell Stock with Transaction Fee
Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.You may complete as many t...原创 2018-10-13 14:20:28 · 241 阅读 · 0 评论 -
leetcode 241. Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.Example 1:Input...原创 2018-10-09 21:04:18 · 145 阅读 · 0 评论 -
leetcode 888. Fair Candy Swap
Alice and Bob have candy bars of different sizes: A[i] is the size of the i-th bar of candy that Alice has, and B[j] is the size of the j-th bar of candy that Bob has.Since they are friends, they wo...原创 2018-08-29 14:38:51 · 152 阅读 · 0 评论