[题目描述] Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s is a short string (<=100). A subseque…

[题目描述] Give an integer array,find the longest increasing continuous subsequence in this array. An increasing continuous subsequence: Can be from right to left or from left to right. Indices of the integers in the subsequence should be continuous. Not…

Content 有一个长度为 \(n\) 的数组,请求出使得 \(a_i \oplus a_j=x\) 且 \(i\neq j\) 的数对 \((i,j)\) 的个数.其中 \(\oplus\) 表示异或符号. 数据范围:\(1\leqslant n,a_i\leqslant 10^5,0\leqslant x\leqslant 10^5\). Solution 利用一个异或的性质:\(a\oplus b=c\Rightarrow a\oplus c=b,b\oplus c=a\),我们发现问题…

[题目描述] Given an array of n integer, and a moving window(size k), move the window at each iteration from the start of the array, find the median of the element inside the window at each moving. (If there are even numbers in the array, return the N/2-t…

[题目描述] Give you an integer array (index from 0 to n-1, where n is the size of this array, data value from 0 to 10000) . For each element Ai in the array, count the number of element before this element Ai is smaller than it and return count number ar…

[题目描述] Give you an integer array (index from 0 to n-1, where n is the size of this array, value from 0 to 10000) and an query list. For each query, give you an integer, return the number of element in the array that are smaller than the given integer…

[题目描述] For an array, we can build a Segment Tree for it, each node stores an extra attribute count to denote the number of elements in the the array which value is between interval start and end. (The array may not fully filled by elements) Design a…

[题目描述] You have two every large binary trees:T1, with millions of nodes, and T2, with hundreds of nodes. Create an algorithm to decide if T2 is a subtree of T1. Notice:A tree T2 is a subtree of T1 if there exists a node n in T1 such that the subtree…

[题目描述] In the classic problem of Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from top to bottom (i.e., each disk sits on top of an ev…

[题目描述] Implement a function to check if a linked list is a palindrome. 设计一种方式检查一个链表是否为回文链表. [题目链接] www.lintcode.com/en/problem/palindrome-linked-list/ [题目解析] 假设一个链表是回文,那么把链表分割为1-n/2,n/2+1-n两个部分,这两个部分肯定是相同的(把第二部分顺序逆转过来或者逆转第一部分).所以如果我们能把任何一个部分的链表顺序逆转过来…

[题目描述] You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in forward order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the…

[题目描述] Write a method to replace all spaces in a string with%20. The string is given in a characters array, you can assume it has enough space for replacement and you are given the true length of the string. You code should also return the new length…

[题目描述] Implement an assignment operator overloading method. Make sure that: The new data can be copied correctly The old data can be deleted / free correctly. We can assign like  A = B = C 实现赋值运算符重载函数,确保: 新的数据可准确地被复制 旧的数据可准确地删除/释放 可进行A = B = C赋值 [题目链…

[题目描述] Partition an integers array into odd number first and even number second. 分割一个整数数组,使得奇数在前偶数在后. [题目链接] www.lintcode.com/en/problem/partition-array-by-odd-and-even/ [题目解析] 1.将数组中的奇数和偶数分开,使用『两根指针』的方法,用快排的思路,右指针分别从数组首尾走起 2.左指针不断往右走直到遇到偶数,右指针不断往左走直…

[题目描述] For the given binary tree, return a deep copy of it. 深度复制一个二叉树,给定一个二叉树,返回一个他的克隆品. [题目链接] www.lintcode.com/en/problem/clone-binary-tree/ [题目解析] 假设有如下链表: |---------------| |                 v 1  --> 2 --> 3 --> 4 节点1的random指向了3.首先我们可以通过next遍…

[题目描述] Given n and k, return the k-th permutation sequence. Notice:n will be between 1 and 9 inclusive. 给定n和k,求123..n组成的排列中的第k个排列. [注]1 ≤ n ≤ 9 [题目链接] www.lintcode.com/en/problem/permutation-sequence/ [题目解析] 这道题给了我们n还有k,在数列 1,2,3,... , n构建的全排列中,返回第k个…

[题目描述] There are n coins in a line. Two players take turns to take one or two coins from right side until there are no more coins left. The player who take the last coin wins. Could you please decide the first play will win or lose? 有 n 个硬币排成一条线.两个参赛…

[题目描述] Say you have an array for which the i th element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most k transactions. Notice:You may not engage in multiple transactions at the same ti…

[题目描述] Given an interval list which are flying and landing time of the flight. How many airplanes are on the sky at most? Notice:If landing and flying happens at the same time, we consider landing should happen at first. 给出飞机的起飞和降落时间的列表,用 interval 序列…

[题目描述] Determine whether a Sudoku is valid. The Sudoku board could be partially filled, where empty cells are filled with the character.. Notice:A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be val…

[题目描述] There are n coins with different value in a line. Two players take turns to take one or two coins from left side until there are no more coins left. The player who take the coins with the most value wins. Could you please decide the first play…

[题目描述] Given a set of n nuts of different sizes and n bolts of different sizes. There is a one-one mapping between nuts and bolts. Comparison of a nut to another nut or a bolt to another bolt is not allowed. It means nut can only be compared with bol…

[题目描述] Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Return 0 if the array contains less than 2 elements. Notice:You may assume all elements in the array are non-negative integers and fit in…

[题目描述] Find the kth smallest number in at row and column sorted matrix. 在一个排序矩阵中找从小到大的第 k 个整数. 排序矩阵的定义为:每一行递增,每一列也递增. [题目链接] www.lintcode.com/en/problem/kth-smallest-number-in-sorted-matrix/ [题目解析] 寻找第k小的数,可以联想到转化为数组后排序,不过这样的时间复杂度较高:O(n^2 log n^2) +…

[题目描述] A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. 给出一个链表,每个节点包含一个额外增加的随机指针可以指向链表中的任何节点或空的节点. 返回一个深拷贝的链表. [题目链接] www.lintcode.com/…

感觉这题还可以 因为总空间比输入数量 不知高到哪里去了 ,所以完全不需要考虑放不下的问题 从贪心的角度考虑,如果要使相差数量巨大的\(b\)和\(w\)能够成功放下来,应该使这些方块尽量分散(似乎有点抽象) 来一发图解 作者因为太懒于是决定直接以B表示黑色,W表示白色 假设有一组方块拼成了一个正方形,如图 BWB WBW BWB 那么在不改变白块数量的情况下,最多还能加\(4\)个黑块,分别连在四个白块旁边 但是如果拉成直线,如图 BWBWBWBWB 发现可以在两边总共加\(8\)个黑块了,因为…

具体思路已经在代码注释中给出,这里不再赘述. #include<iostream> #include<algorithm> using namespace std; int t; string s; int main() { cin >> t; while(t--) { cin >> s; int len = s.size(); int total0 = 0, total1 = 0; for(int i = 0; i < len; i++) { tot…

problem 674. Longest Continuous Increasing Subsequence solution class Solution { public: int findLengthOfLCIS(vector<int>& nums) { , cnt = , cur = INT_MAX; for(auto num:nums) { if(num>cur) cnt++; ; res = max(res, cnt); cur = num; } return res…

Content 假设 \(1\) 年有 \(n\) 天,而每周同样会有 \(5\) 天工作日和 \(2\) 天休假.求一年最小的休假天数和最大休假天数. 数据范围:\(1\leqslant n\leqslant 10^6\). Solution 题解区的做法都稍麻烦了些,其实这道题目只需要两行代码就能够搞定.一行输入,一行输出结果. 没听错,一行直接输出答案.原因是这道题目其实是有公式的. 首先我们知道,一年里面有 \(\left\lfloor\dfrac n7\right\rfloor\) 个…

Question 594. Longest Harmonious Subsequence Solution 题目大意:找一个最长子序列,要求子序列中最大值和最小值的差是1. 思路:构造一个map,保存每个元素出现的个数,再遍历这个map,算出每个元素与其邻元素出现的次数和,并找到最大的那个数 Java实现: public int findLHS(int[] nums) { if (nums == null || nums.length == 0) return 0; Map<Integer, I…