这篇文章中，我们将实现在 HLSL 下的漫反射光照绘制。漫反射的原理我们在 OpenGL 学习笔记中已经详细提及，这里就省下篇幅了。
Binary-Tree-Level-Order-Traversal-II
发表于
|
更新于：
题目地址
LeetCode#107 Binary Tree Level Order Traversal II
简直了，今天一进 LeetCode 网站，就弹出提示让我迁移到 LeetCode 国区，没想到竟然有中文版了？？？（而且中文版名字贼丑，力扣）是不是这是最后一个在 LeetCode 外区做的题了？
题目描述
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).
【DirectX】11-3DRender
发表于
|
更新于：
教程地址
Tutorial 7: 3D Model Rendering
学习记录
渲染 3D 图形的话和 2D 视角不同，我们必须使用 3D 摄像机视角，如果对摄像机以及矩阵作用不太懂的话可以看这里：【OpenGL】10-摄像机 。
Chunks-To-Make-Sorted-II
发表于
|
更新于：
题目地址
LeetCode#768 Max Chunks To Make Sorted II
题目描述
This question is the same as “Max Chunks to Make Sorted” except the integers of the given array are not necessarily distinct, the input array could be up to length 2000, and the elements could be up to 10**8.
Given an array arr of integers (not necessarily distinct), we split the array into some number of “chunks” (partitions), and individually sort each chunk. After concatenating them, the result equals the sorted array.
Lexicographical-Numbers
发表于
|
更新于：
题目地址
LeetCode#386 Lexicographical Numbers
题目描述
Given an integer n, return 1 - n in lexicographical order.
For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].
Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.