![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
未完待续
lemonade13
这个作者很懒,什么都没留下…
展开
-
【知识总结】git命令的使用【未完待续】
git非常常用,但是一直没有系统地了解过它的原理,此篇借助https://learngitbranching.js.org/?locale=zh_CN来练习git命令,记录每个关卡练习后对该命令的理解。基础命令git commit:提交改动到当前分支(默认为master)。git branch a:新建名为a的分支。git checkout a:head指针切换到a分支,当前分支为...原创 2020-04-09 14:27:28 · 161 阅读 · 0 评论 -
【leetcode】【hard】52. N-Queens II
52. N-Queens IIThen-queens puzzle is the problem of placingnqueens on ann×nchessboard such that no two queens attack each other.Given an integern, return the number ofdistinct solutions t...原创 2020-03-02 12:32:26 · 94 阅读 · 0 评论 -
【leetcode】第 178 场周赛
比赛链接:https://leetcode-cn.com/contest/weekly-contest-178/赛后总结这场比赛打得不太顺,可能是和最近写代码思路很卡有关?这周刷的是回溯法,刷到二维平面还处在很难受的阶段。不过提升是缓慢的,量变积累质变嘛。第一题:总体思路还是清晰的,用了大概十分钟。还可以更快更熟练。第二题:这道题不难,和第一题的思路类似,只是过程复杂一些。选择...原创 2020-03-01 17:02:36 · 133 阅读 · 0 评论 -
【leetcode】【medium】77. Combinations
77. CombinationsGiven two integersnandk, return all possible combinations ofknumbers out of 1 ...n.Example: Input:n = 4, k = 2Output:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1...原创 2020-02-26 16:27:31 · 63 阅读 · 0 评论 -
【leetcode】【medium】46. Permutations
46. PermutationsGiven a collection ofdistinctintegers, return all possible permutations.Example:Input: [1,2,3]Output:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]题目...原创 2020-02-26 14:18:54 · 77 阅读 · 0 评论 -
【leetcode】【medium】131. Palindrome Partitioning
131. Palindrome PartitioningGiven a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.Example:Input:"aab"Outp...原创 2020-02-25 13:39:01 · 80 阅读 · 0 评论 -
【leetcode】【medium】17. Letter Combinations of a Phone Number
17. Letter Combinations of a Phone NumberGiven a string containing digits from2-9inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters ...原创 2020-02-25 10:37:33 · 80 阅读 · 0 评论 -
【题型总结】求最低公共祖先【未完待续】
同样是求最低公共祖先的题,在不同的树的条件下,思路有差别。对于树的题,都同时可以同递归和非递归方法实现。1.BST最简单的类型,详见:235.Lowest Common Ancestor of a Binary Search Tree时间O(logn),空间O(1)。2.普通树,有父节点指针先分别找到目标节点,再逆向走父节点指针取出路径,问题转而求两个链表的第一个公...原创 2020-02-24 17:50:23 · 101 阅读 · 0 评论 -
【DS总结】C++容器使用对比和选择【未完待续】
参考:https://www.cnblogs.com/engineerLF/p/5393006.html原创 2020-02-24 11:47:33 · 178 阅读 · 0 评论 -
【leetcode】【medium】98. Validate Binary Search Tree
98.Validate Binary Search TreeGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with key...原创 2020-02-21 14:22:28 · 70 阅读 · 0 评论 -
【leetcode】【easy】437. Path Sum III
437.Path Sum IIIYou are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does not need to start or end at the root or...原创 2020-02-20 15:46:39 · 82 阅读 · 0 评论 -
【leetcode】【medium】129. Sum Root to Leaf Numbers
129.Sum Root to Leaf NumbersGiven a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which represents...原创 2020-02-20 15:02:47 · 69 阅读 · 0 评论 -
【leetcode】【hard】126. Word Ladder II
126. Word Ladder IIGiven two words (beginWordandendWord), and a dictionary's word list, find all shortest transformation sequence(s) frombeginWordtoendWord, such that:Only one letter can be c...原创 2020-02-17 19:25:20 · 92 阅读 · 0 评论 -
【leetcode】【medium】113. Path Sum II
113.Path Sum IIGiven a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.Note:A leaf is a node with no children.Example:Given the below binary tre...原创 2020-02-20 12:31:38 · 106 阅读 · 0 评论