yyfly22-CSDN博客

转载 matlab calibration toolbox -- matlab标定工具的使用方法--去畸变和双目校正

matlab calibration toolbox是相机标定以及校正用的工具箱。首先下载这个工具箱，免费下载地址：http://www.vision.caltech.edu/bouguetj/calib_doc/download/index.html。它的英文使用示例在下面这个网址上有：http://www.vision.caltech.edu/bouguetj/calib_doc/。

2017-02-18 11:19:10 1263

原创 LeetCode: Container With Most Wate

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin

2017-02-14 21:07:11 254

原创 LeetCode: 4Sum

Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note: The solution

2017-02-14 16:12:10 217

原创 LeetCode: 3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact

2017-02-13 22:37:35 232

原创 LeetCode: 3Sum

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not contain

2017-02-13 22:15:11 171

In LLP world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning tim

2017-02-13 10:37:44 233

原创 Maximum Product Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest

2017-02-13 10:26:14 169

原创 LeetCode: Third Maximum Number

Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Input: [3, 2,

2017-02-11 21:14:18 170

原创 LeetCode: Max Consecutive Ones

Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are consecutiv

2017-02-11 20:28:59 163

原创 LeetCode: Combination Sum IV

Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.Example:nums = [1, 2, 3]target = 4The pos

2017-02-11 20:16:10 190

原创 LeetCode: Partition Equal Subset Sum

Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note:Each of the array

2017-02-09 18:18:24 223

原创 LeetCode: Target Sum

You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.Find out

2017-02-09 18:12:38 253

原创 LeetCode: Total Hamming Distance

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Now your job is to find the total Hamming distance between all pairs of the giv

2017-02-09 11:03:57 367

原创 LeetCode: Hamming Distance

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note:0 ≤ x,

2017-02-09 10:42:11 196

原创 LeetCode: Combination Sum

Given a set of candidate numbers (C)(without duplicates) and a target number (T), find all unique combinations inC where the candidate numbers sums to T.The same repeated number may be chosen

2017-02-07 16:54:44 182

原创 LeetCode: Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inC where the candidate numbers sums to T.Each number in C may only be used once in the combinatio

2017-02-07 16:53:35 174

原创 Leetcode: Combination Sum III

Find all possible combinations of k numbers that add up to a numbern, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Example 1:Input:

2017-02-07 16:51:33 175

转载 Win10 + Opencv3.1 + Extral_contrib + VS2015

注意：OpenCV_contrib不稳定，安装有风险！一、前言1、为什么要安装OpenCV_contrib之前有一篇文章讲解了如何安装并配置OpenCV3.1.0，然而这里面所包含的库只有基础内容，而实际上OpenCV还添加了一个额外的库，以供更需要的人使用，其中就包括了人脸识别、matelab调用、RGB加工、深层神经网络等内容，显然可是opencv异常强大。官方文档展示

2016-12-20 10:59:54 1497 1

原创 LeetCode: Sort Colors

Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers

2016-09-20 00:14:28 184

原创 LeetCode: Unique Paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the

2016-09-19 12:02:51 177

原创 LeetCode: Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.题目解析: 到达当前位置(i, j)只有两条路经要么是从左边(i, j- 1)过来，要么从

2016-09-19 11:12:02 156

原创 LeetCode: Find Minimum in Rotated Sorted Array

Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplicate exists in

2016-09-17 20:19:55 153

转载 Android开发——Android Studio使用新的Gradle构建工具配置NDK环境

本文主要讲述了如何如何在Android Studio使用新的Gradle构建工具配置NDK环境，现在把相关的步骤整理出来分享给Android程序员兄弟们，希望给他们在配置NDK环境时带来帮助。从Android Studio 1.3 Beta1开始，就支持了NDK。不过使用的是一个全新的实验性的gradle构建工具。官方地址 http://tools.android.com/tech-doc

2016-09-17 18:47:05 287

转载 [Android] 环境配置之Android Studio开发NDK

原文链接：http://blog.csdn.net/qiujuer/article/details/42040963说到 NDK 开发，其实是为了有些时候为了项目需求需要调用底层的一些 C/C++ 的一些东西；另外就是为了效率更加高些。但是很多时候能不用就不用；这个是啥原因？个人感觉有些时候是觉得麻烦，首先要配置 NDK 还要下载 Cygwin ，配置 Cygwin ,然后需

2016-09-17 18:20:03 176

原创 LeetCode: Find Peak Element

A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in

2016-09-16 12:31:43 263

原创 LeetCode: Two Sum II - Input array is sorted

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two number

2016-09-15 11:42:03 171

原创 LeetCode: Perfect Squares

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =

2016-09-14 23:48:49 184

原创 LeetCode: Climbing Stairs

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个台阶只可能两种方式达到，从n-1阶走一步

2016-09-14 23:31:37 164

原创 LeetCode: Length of Last Word

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is

2016-09-13 23:07:34 164

原创 LeetCode: Subsets

Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3], [1],

2016-09-12 17:17:43 174

原创 LeetCode: Intersection of Two Linked Lists

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 → a2 ↘

2016-09-12 16:55:50 159

原创 LeetCode: Is Subsequence

Given a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) strin

2016-09-08 22:57:55 132

原创 LeetCode: Contains Duplicate II

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j]and the difference between i and j is at most k.

2016-09-08 22:06:33 194

原创 LeetCode: Count Primes

Description:Count the number of prime numbers less than a non-negative number, n.Credits:Special thanks to @mithmatt for adding this problem and creating all test cases.Hint:Let's

2016-09-07 23:08:25 204

原创 LeetCode: Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum

2016-09-07 22:48:04 179

原创 LeetCode: Remove Duplicates from Sorted Array

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

2016-09-06 18:34:25 156

原创 LeetCode: Linked List Cycle II

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up:Can you solve it without using extra space?

2016-09-06 17:41:19 185

原创 LeetCode:　Linked List Cycle

Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?/** * Definition for singly-linked list. * struct ListNode { * int val;

2016-09-06 17:37:13 215

原创 LeetCode: Swap Nodes in Pairs

Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y

2016-09-06 12:55:22 170

原创 LeetCode: Remove Duplicates from Sorted List

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

2016-09-02 16:55:51 184

界面的控制

空空如也