- 博客(9)
- 资源 (1)
- 收藏
- 关注
原创 解决Emgu.CV.CvInvoke 无法加载 DLL“opencv_core2410”
问题如下: 搜了很多博客,给出的方案也很多。 其实很简单:只要把opencv下的opencv_core2410.dll放到你所在项目的bin目录的debug下。不要用emgucv解压出来的dll就行了。我的问题解决了。可能每个人情况不一样
2017-03-13 22:45:59 1798
原创 198. House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses
2017-03-07 09:56:19 208
原创 328. Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in plac
2017-03-06 10:41:42 157
原创 319. Bulb Switcher
There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning off i
2017-03-06 09:47:25 228
原创 318. Maximum Product of Word Lengths
Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case lette
2017-03-05 12:08:51 172
转载 416. 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 element
2017-03-05 11:49:23 238
原创 300. Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101], therefore
2017-03-03 10:25:01 172
原创 279. 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 = 13, return
2017-03-01 15:36:40 294
原创 199. Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example: Given the following binary tree, 1
2017-03-01 14:05:13 197
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人