<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dldldl1994的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dldldl1994</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dldldl1994]]></copyright><item><title><![CDATA[广联达二面]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/107943684</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/107943684</guid><author>dldldl1994</author><pubDate>Wed, 21 Oct 2020 19:04:14 +0800</pubDate><description><![CDATA[1、自我介绍
主要包括兴趣爱好、特长、家乡、家庭情况、学习成绩等。
2.自我评价
说三个关键词来形容一下自己
三个词评价你自己并举出例子。
我认为最能概括自己的三个词是：学习、心态、执行力。
学习包括两个方面，有随时学习的意识和良好的学习方法。遇到不懂的东西就马上去学习，上网查资料，向同行的高手学习，这都是我经常用的学习方法。
心态好，遇到困难不会被困难吓住，不会退缩，我会尽自己最大的努力来解决。
执行力：执行力强，我每天坚持学习，写总结反思自己。不管是遇到什么情况，哪怕是过年过节，自己生病、出差在外，我都]]></description><category></category></item><item><title><![CDATA[TP 面经]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/108464696</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/108464696</guid><author>dldldl1994</author><pubDate>Thu, 24 Sep 2020 15:06:03 +0800</pubDate><description><![CDATA[作者：workingInShenghuaBuliding
链接：https://www.nowcoder.com/discuss/502650?type=post&amp;order=time&amp;pos=&amp;page=1&amp;channel=1009&amp;source_id=search_post
来源：牛客网
问考研还是保研，大学成绩排名，研究方向偏硬件还是算法，学过的和电路通信有关的课程，说说你知道的市场里的硬件公司，输出功率匹配(回答输出电阻和输入电阻相等)，为什么是共轭匹配(我不]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 95. Unique Binary Search Trees II]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103946563</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103946563</guid><author>dldldl1994</author><pubDate>Mon, 13 Jan 2020 22:01:18 +0800</pubDate><description><![CDATA[题目：
Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.
Example:
Input: 3
Output:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,nul...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 96. Unique Binary Search Trees]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103947344</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103947344</guid><author>dldldl1994</author><pubDate>Mon, 13 Jan 2020 19:34:02 +0800</pubDate><description><![CDATA[题目：
Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?
Example:
Input: 3
Output: 5
Explanation:
Given n = 3, there are a total of 5 unique BST’s:
1         3   ...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 89. Gray Code]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103490091</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103490091</guid><author>dldldl1994</author><pubDate>Wed, 11 Dec 2019 20:21:17 +0800</pubDate><description><![CDATA[题目：
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 88. Merge Sorted Array]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103436157</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103436157</guid><author>dldldl1994</author><pubDate>Mon, 09 Dec 2019 21:10:34 +0800</pubDate><description><![CDATA[题目：
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
The number of elements initialized in nums1 and nums2 are m and n respectively.
You may assume th...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 86. Partition List]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103325203</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103325203</guid><author>dldldl1994</author><pubDate>Wed, 04 Dec 2019 22:38:55 +0800</pubDate><description><![CDATA[题目：
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each o...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 82. Remove Duplicates from Sorted List II]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103302769</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103302769</guid><author>dldldl1994</author><pubDate>Sat, 30 Nov 2019 13:45:15 +0800</pubDate><description><![CDATA[题目：
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
Example 1:
Input: 1-&gt;2-&gt;3-&gt;3-&gt;4-&gt;4-&gt;5
Output: 1-&g...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 83. Remove Duplicates from Sorted List]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103281495</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103281495</guid><author>dldldl1994</author><pubDate>Wed, 27 Nov 2019 21:47:10 +0800</pubDate><description><![CDATA[题目：
Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
Input: 1-&gt;1-&gt;2
Output: 1-&gt;2
Example 2:
Input: 1-&gt;1-&gt;2-&gt;3-&gt;3
Output: 1-&gt...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 81. Search in Rotated Sorted Array II]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103263056</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103263056</guid><author>dldldl1994</author><pubDate>Wed, 27 Nov 2019 12:46:47 +0800</pubDate><description><![CDATA[题目：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).
You are given a target value to search. If foun...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 80. Remove Duplicates from Sorted Array II]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103229976</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103229976</guid><author>dldldl1994</author><pubDate>Mon, 25 Nov 2019 20:06:06 +0800</pubDate><description><![CDATA[题目：
Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.
Do not allocate extra space for another array, you must do this by ...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录61. Rotate List]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/102532711</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/102532711</guid><author>dldldl1994</author><pubDate>Sun, 24 Nov 2019 14:02:11 +0800</pubDate><description><![CDATA[题目：
Given a linked list, rotate the list to the right by k places, where k is non-negative.
Example 1:
Input: 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL, k = 2
Output: 4-&gt;5-&gt;1-&gt;2-&gt;3-&gt;NULL
Expla...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 90. Subsets II]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103072560</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103072560</guid><author>dldldl1994</author><pubDate>Sat, 23 Nov 2019 16:48:44 +0800</pubDate><description><![CDATA[题目：
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Example:
Input: [1,2,2]
...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 78. Subsets]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103002025</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103002025</guid><author>dldldl1994</author><pubDate>Sat, 23 Nov 2019 16:31:37 +0800</pubDate><description><![CDATA[题目：
Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Example:
Input: nums = [1,2,3]
Output:
[
[3],
[1],
[...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 79. Word Search]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/103171684</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/103171684</guid><author>dldldl1994</author><pubDate>Fri, 22 Nov 2019 22:21:36 +0800</pubDate><description><![CDATA[题目：
Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or verticall...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 77. Combinations]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/102987853</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/102987853</guid><author>dldldl1994</author><pubDate>Sun, 10 Nov 2019 16:17:29 +0800</pubDate><description><![CDATA[题目：
Given two integers n and k, return all possible combinations of k numbers out of 1 … n.
Example:
Input: n = 4, k = 2
Output:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]
解法1：
递归法
c++：
class Solut...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 75. Sort Colors]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/102904955</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/102904955</guid><author>dldldl1994</author><pubDate>Thu, 07 Nov 2019 23:15:59 +0800</pubDate><description><![CDATA[题目：
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we will use the...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录74. Search a 2D Matrix]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/102903633</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/102903633</guid><author>dldldl1994</author><pubDate>Mon, 04 Nov 2019 20:29:34 +0800</pubDate><description><![CDATA[题目：
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
Integers in each row are sorted from left to right.
The first integer of each r...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录73. Set Matrix Zeroes]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/102881605</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/102881605</guid><author>dldldl1994</author><pubDate>Sun, 03 Nov 2019 22:09:27 +0800</pubDate><description><![CDATA[题目：
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.
Example 1:
Input:
[
[1,1,1],
[1,0,1],
[1,1,1]
]
Output:
[
[1,0,1],
[0,0,0],
[1,0,1]
]
Example 2:
Input...]]></description><category></category></item><item><title><![CDATA[LeetCode 刷题记录 71. Simplify Path]]></title><link>https://blog.youkuaiyun.com/dldldl1994/article/details/102847252</link><guid>https://blog.youkuaiyun.com/dldldl1994/article/details/102847252</guid><author>dldldl1994</author><pubDate>Sat, 02 Nov 2019 16:49:34 +0800</pubDate><description><![CDATA[题目：
Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.
In a UNIX-style file system, a period . refers to the current directory. Furthermo...]]></description><category></category></item></channel></rss>