码迷,mamicode.com
首页 >  
搜索关键字:depth    ( 1433个结果
depthstencil buffer 不支持 msaa
phyreengine dx11 MRT不支持depth rendertarget 的msaa他里面竟然只写着,// not supported yet!!!!导致hdao 时开msaa的话,depth 用不了,因为depth target没有被resolve,连srv他都没建立呢solution把...
分类:其他好文   时间:2015-05-04 17:08:11    阅读次数:151
leetcode-Balanced Binary Tree
题目描述 Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node n...
分类:其他好文   时间:2015-05-04 12:06:20    阅读次数:96
普林斯顿大学《算法II》第二周学习笔记 Directed Graph
有向图的遍历和无向图的遍历类似,主要是DFS和BFS。对于DAG(Directed Acyclic Graph),还有一个很重要的拓扑的概念,拓扑排序的倒序可以用Depth-first search来生成,类似二叉树的后序遍历。见Depthfirst Order in Algs4private vo...
分类:编程语言   时间:2015-05-02 16:26:11    阅读次数:160
【LeetCode】Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1....
分类:其他好文   时间:2015-05-01 17:25:28    阅读次数:115
LeetCode Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 题意:求树的高度。 思路:就是递归。 /** * Definiti...
分类:其他好文   时间:2015-05-01 12:06:48    阅读次数:163
LeetCode - Minimum Depth of Binary Tree
求二叉树的最小深度。/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) ...
分类:其他好文   时间:2015-04-29 01:57:40    阅读次数:114
texture+depth 源文件下载 (视点> 3)
做背景建模3视点的文件效果不好,所以找了半天文件。就找到两个,贴在下面。 下载地址: depth: http://www.tanimoto.nuee.nagoya-u.ac.jp/mpeg/depth_exhibition.htm texture:http://www.tanimoto.nuee.nagoya-u.ac.jp/mpeg/file/akko_and_kayo_cam.h...
分类:其他好文   时间:2015-04-27 23:50:56    阅读次数:192
Unity NGUI 中特效(粒子)的显示
NGUI添加粒子特效时,被UI遮挡因为粒子系统的渲染顺序列默认为3000,而NGUI的渲染顺序默认也是从3000开始,当有嵌套的panel时或者Depth更高的panel时,GUI的渲染顺序会高于3000,解决办法是:1.修改Ngui中的UIPanel脚本中的默认的RenderQueue, 调整到3...
分类:编程语言   时间:2015-04-27 19:50:54    阅读次数:151
leetcode:Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth...
分类:其他好文   时间:2015-04-26 16:31:44    阅读次数:119
OJ练习26——T111 Minimum Depth of Binary Tree
求从根节点到叶子节点的最短路径。【思路】开始想到返回左右子树最短深度,测试发现对于一个根节点带一个孩子节点,其最短路径是2,不是最小深度1,此种特殊情况单独列出。【my code】int minDepth(TreeNode *root) { if(root==NULL) ...
分类:其他好文   时间:2015-04-24 08:56:48    阅读次数:114
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!