2014年11月_zhangla1220

11月 10月 09月 08月 07月 06月

原创最近邻内插值与双线性插值

最近邻内插值与双线性插值的实现

2014-11-11 17:36:14 16322 4

转载 OpenCv中 width 和 widthStep的区别

前者是表示图像的每行像素数，后者指表示存储一行像素需要的字节数。在OpenCV里边，widthStep必须是4的倍数，从而实现字节对齐，有利于提高运算速度。如果8U单通道图像宽度为3，那么widthStep是4，加一个字节补齐。这个图像的一行需要4个字节，只使用前3个，最后一个空着。也就是一个宽3高3的图像的imageData数据大小为4*3=12字节。

2014-11-11 13:18:59 8521

原创数字图像处理入门笔记

图像领域分类：图像处理，属于低层视觉分析

2014-11-10 15:32:06 1144

转载 ViBe算法中文分析（转载）

原文地址 http://blog.csdn.net/stellar0/article/details/8777283

2014-11-06 15:13:28 1177

原创 Remove Element - LeetCode

Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.class

2014-11-03 15:36:48 368

原创 Climbing Stairs - LeetCode

You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?分析：n = 1时，S

2014-11-03 15:19:40 415

原创 Remove Duplicates from Sorted Array-LeetCode

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with c

2014-11-03 14:32:58 360

原创 Remove Duplicates from Sorted List -LeetCode

Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3./** * Definition for si

2014-11-03 14:16:35 357

原创 vs2010自动排版快捷键

全选 Ctrl+A排版 ctrl+K,F 按住ctrl，相继按下K、F

2014-11-03 10:41:12 1074

原创 Valid Parentheses- LeetCode

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all vali

2014-11-03 10:33:28 408

原创 Remove Nth Node From End of List -LeetCode

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 removing the second node from the end, the

2014-11-03 10:09:41 393

原创 Merge Sorted Array-LeetCode

Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B.

2014-11-02 17:41:06 480 1

原创 Same Tree - LeetCode

Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.这道题感觉不难做出来后每次

2014-11-02 16:50:41 435

原创 ZigZag Conversion-LeetCode

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I

2014-11-02 15:34:59 529

原创 Maximum Depth of Binary Tree - LeetCode

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./** * Definition for binary tree *

2014-11-02 14:15:50 422

原创 Binary Tree Level Order Traversal II-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).For example:Given binary tree {3,9,20,#,#,15,7},

2014-11-02 13:55:06 405

文件名批量修改

简单说明一下软件和使用方法：文件批量修改器：用于规范文件夹内的所有文件名称成一种统一的格式。名称格式可选： 1.ID自增 2.前缀_原名称 3.原名称_ID自增 4.前缀_ID自增格式使用说明：http://blog.csdn.net/zhangla1220/article/details/39957805

2014-10-22

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人