02 2016 档案
摘要：题目： Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: ["1->2
阅读全文
摘要：二叉堆是一种特殊的堆，二叉堆是完全二元树（二叉树）或者是近似完全二元树（二叉树）。 二叉堆有两种：最大堆和最小堆。 最大堆：父结点的键值总是大于或等于任何一个子结点的键值； 最小堆：父结点的键值总是小于或等于任何一个子节点的键值。 二叉堆一般都通过"数组"来实现。数组实现的二叉堆，父节点和子节点的位
阅读全文
摘要：题目： Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a l
阅读全文
摘要：题目： Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After
阅读全文
摘要：题目： Remove all elements from a linked list of integers that have value val. ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 -->
阅读全文
摘要：题目： Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 →
阅读全文
摘要：题目: Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1
阅读全文
摘要：题目： Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"]. 代
阅读全文
摘要：题目： Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1]. Note:Could you optimize your algorithm t
阅读全文
摘要：根据前面两个笔记的内容，我们来封装一个简单的基类，方便以后的使用。 代码和前面类似，没有什么新的内容，直接看代码吧(由于代码上次都注释了，这次代码就没怎么写注释o(╯□╰)o) Dx11DemoBase.h Dx11DemoBase.h #pragma once #include <d3d11.h>
阅读全文
