题目： Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times. Example 1: Input: intervals = [[1,3],[6,9]], newInterval = [2,5] Output: [[1,5],[6,9]]Example 2: Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8] Output: [[1,2],[3,10],[12,16...
题目： Given a collection of intervals, merge all overlapping intervals. Example 1: Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].Example 2: Input: [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping. NOTE: input types have been changed on April 15, 2019. Pl...
题目： 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, except for the root node which has no parents. The given input is a directed graph that started as a rooted tree with N nodes (with distinct values 1, 2, ..., N), with one additional directed edge a...
题目： On an NxN chessboard, a knight starts at the r-th row and c-th column and attempts to make exactly K moves. The rows and columns are 0 indexed, so the top-left square is (0, 0), and the bottom-right square is (N-1, N-1). A chess knight has 8 possible moves it can make, as illustrated below. Each move is two squares in a cardinal direction, then one square in an orthogonal direction. Each...
题目： Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the root. The length of path between two nodes is represented by the number of edges between them. Example 1: Input:5/ 4 5/ \ 1 1 5Output: 2 Example 2: Input:1/ 4 5/ \ 4 4 5Output: 2 N...
题目： In this problem, a tree is an undirected graph that is connected and has no cycles. The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, ..., N), with one additional edge added. The added edge has two different vertices chosen from 1 to N, and was not an edge that already existed. The resulting graph is given as a 2D-array of edges. Each element of edge...
规则 爱丽丝和鲍勃一起玩游戏，他们轮流行动。爱丽丝先手开局。 最初，黑板上有一个数字 N 。在每个玩家的回合，玩家需要执行以下操作： 选出任一 x，满足 0 < x < N 且 N % x == 0 。 用 N - x 替换黑板上的数字 N 。 如果玩家无法执行这些操作，就会输掉游戏。 只有在爱丽丝在游戏中取得胜利时才返回 True，否则返回 false。假设两个玩家都以最佳状态参与游戏。 示例 示例 1： 输入：2 输出：true 解释：爱丽丝选择 1，鲍勃无法进...
我的代码十分简单，“暴力型”的： class Solution { public:vector<int> twoSum(vector<int>& nums, int target) {for(auto i=0;i<nums.size();i++){for(auto j=0;j<nums.size();j++){if((target-nums[i]==nums[j])&&i!=j){vector<int> a;a.push_back(i);a.push_back(j);return a;}}}vector<int> emptyvector;return emptyvector;} }; 还编译错误了好几次！虽然对了，可是用时不大乐观：我都不好意思晒出来……我太菜了…… 不过我...
放假没事刷几道leetcode，一些常见典型题的答案和解析。 平时python用的比较多，但分析复杂度的时候用python编程不方便，所以刷题的时候用了c++ C++基础《C++编程思想》笔记 vector, list, dequeue stack, queue string pair, set, map algorithm数组&链表 https://www.yuque.com/yahei/hey-yahei/leetcode-array_linkedlist206反转链表 024两两交换链表中的节点 025K个一组翻转列表 141环形链表 142环形链表-找到入口节点栈&队列 ...
Leetcode C++《热题 Hot 100-20》617.合并二叉树题目 给定两个二叉树，想象当你将它们中的一个覆盖到另一个上时，两个二叉树的一些节点便会重叠。你需要将他们合并为一个新的二叉树。合并的规则是如果两个节点重叠，那么将他们的值相加作为节点合并后的新值，否则不为 NULL 的节点将直接作为新二叉树的节点。 示例 1: 输入: Tree 1 Tree 2 1 2 / \ / \ 3 2 ...
Leetcode C++《热题 Hot 100-9》155.最小栈题目 设计一个支持 push，pop，top 操作，并能在常数时间内检索到最小元素的栈。 push(x) – 将元素 x 推入栈中。 pop() – 删除栈顶的元素。 top() – 获取栈顶元素。 getMin() – 检索栈中的最小元素。示例: MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3); minStack.getMin(); --> 返回 -3. minStack.pop(); minStack.top(); --...
/* 将一个给定字符串根据给定的行数，以从上往下、从左到右进行 Z 字形排列。 */#include "iostream" #include "string" #include "vector"using namespace std;class Solution { public:string convert(string s, int numRows){if (numRows == 1)return s;int len = s.length();int step = 2 * numRows - 2; // 间距int curor, sub;string ans;for (int i = 0; i < numRows; i++){curor = i;sub = 2 * i;while (curor < len){ans ...
/* 给定一个字符串 s，找到 s 中最长的回文子串。你可以假设 s 的最大长度为 1000。 */#include "iostream" #include "string" #include "vector"#define MAX 1000using namespace std;class Solution { public:string longestPalindrome(string s){string man_s;int i, s_size = s.size();if (s_size <= 1)return s;// 预处理man_s.push_back('$');for (i = 0; i < s_size; i++){man_s.push_back('#');man_s.push_back(s[i]);}man...
10-正则表达式匹配@Author：CSU张扬 @Email：csuzhangyang@gmail.com or csuzhangyang@qq.com1. 题目 给你一个字符串 s 和一个字符规律 p，请你来实现一个支持 ‘.’ 和 ‘*’ 的正则表达式匹配。 '.' 匹配任意单个字符 '*' 匹配零个或多个前面的那一个元素所谓匹配，是要涵盖 整个 字符串 s的，而不是部分字符串。 说明:s 可能为空，且只包含从 a-z 的小写字母。 p 可能为空，且只包含从 a-z 的小写字母，以及字符 . 和 *。示例 1...
题目： Implement a magic directory with buildDict, and search methods. For the method buildDict, youll be given a list of non-repetitive words to build a dictionary. For the method search, youll be given a word, and judge whether if you modify exactly one character into another character in this word, the modified word is in the dictionary you just built. Example 1: Input: buildDict(["hello", "lee...