ÉÏÒ»Ò³ 1 ¡¤¡¤¡¤ 40 41 42 43 44
ÕªÒª£º You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in num ÔĶÁÈ«ÎÄ
posted @ 2014-10-29 15:25 Grandyang ÔĶÁ(20962) ÆÀÂÛ(3) ÍƼö(1) ±à¼­
ÕªÒª£º An enumeration of the different camera properties that can be set via the API.Declarationenum FlyCaptureProperty { FLYCAPTURE_BRIGHTNESS, FLYCAPTU... ÔĶÁÈ«ÎÄ
posted @ 2014-10-27 13:24 Grandyang ÔĶÁ(1264) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally ident ÔĶÁÈ«ÎÄ
posted @ 2014-10-27 07:54 Grandyang ÔĶÁ(14268) ÆÀÂÛ(6) ÍƼö(0) ±à¼­
ÕªÒª£º Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: But the fol ÔĶÁÈ«ÎÄ
posted @ 2014-10-26 10:49 Grandyang ÔĶÁ(17253) ÆÀÂÛ(17) ÍƼö(2) ±à¼­
ÕªÒª£º 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 l ÔĶÁÈ«ÎÄ
posted @ 2014-10-26 07:32 Grandyang ÔĶÁ(21973) ÆÀÂÛ(9) ÍƼö(0) ±à¼­
ÕªÒª£º Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf ÔĶÁÈ«ÎÄ
posted @ 2014-10-26 05:23 Grandyang ÔĶÁ(13933) ÆÀÂÛ(1) ÍƼö(0) ±à¼­
ÕªÒª£º Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree {3 ÔĶÁÈ«ÎÄ
posted @ 2014-10-26 04:57 Grandyang ÔĶÁ(28553) ÆÀÂÛ(11) ÍƼö(2) ±à¼­
ÕªÒª£º How to read and write pixel dataBitmap processingImage StrideBayer Color Filter PatternHigh-Quality Algorithm for Bayer Pattern InterpolationToolBox:I... ÔĶÁÈ«ÎÄ
posted @ 2014-10-24 10:54 Grandyang ÔĶÁ(526) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º 8-Bit and 16-Bit Images¹ØÓÚÁ¿»¯Ñ¹ËõÓëÁ¿»¯²¹³¥RGB Bayer Color·ÖÎö²ÊÉ«CCD/CMOSµÄ¸ñʽºÍ¼ÆËã»úÖеĶÁÈ¡¸ñʽ ÔĶÁÈ«ÎÄ
posted @ 2014-10-24 10:20 Grandyang ÔĶÁ(586) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º Point Grey areaDetector driverBumblebee XB3 Specifications FlyCapture SDK Example Source CodeUnderstanding Format_7 region of interest and pixel binni... ÔĶÁÈ«ÎÄ
posted @ 2014-10-24 07:28 Grandyang ÔĶÁ(377) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º Integrating the FlyCapture SDK for use with OpenCVCStereoGrabber_Bumblebee.hOpenCV with PGR Flycapture camerashttp://www.cis.fordham.edu/twiki/pub/Mai... ÔĶÁÈ«ÎÄ
posted @ 2014-10-24 07:16 Grandyang ÔĶÁ(368) ÆÀÂÛ(1) ÍƼö(0) ±à¼­
ÕªÒª£º 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 dep ÔĶÁÈ«ÎÄ
posted @ 2014-10-23 13:59 Grandyang ÔĶÁ(17966) ÆÀÂÛ(7) ÍƼö(0) ±à¼­
ÕªÒª£º Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l ÔĶÁÈ«ÎÄ
posted @ 2014-10-22 07:27 Grandyang ÔĶÁ(18841) ÆÀÂÛ(5) ÍƼö(3) ±à¼­
ÕªÒª£º Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum ÔĶÁÈ«ÎÄ
posted @ 2014-10-22 06:45 Grandyang ÔĶÁ(18839) ÆÀÂÛ(6) ÍƼö(1) ±à¼­
ÕªÒª£º RT..½«²©¿Í°áÖÁCSDN ÔĶÁÈ«ÎÄ
posted @ 2014-10-21 15:40 Grandyang ÔĶÁ(577) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º Suppose an array sorted in ascending order 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]). F ÔĶÁÈ«ÎÄ
posted @ 2014-10-21 15:15 Grandyang ÔĶÁ(11158) ÆÀÂÛ(4) ÍƼö(0) ±à¼­
ÕªÒª£º ExampleLanguageDescriptionAsyncTriggerExC++Demonstrates some of the basic asynchronous trigger capabilities of compatible PGR Imaging Products.AsyncTr... ÔĶÁÈ«ÎÄ
posted @ 2014-10-21 06:21 Grandyang ÔĶÁ(3634) ÆÀÂÛ(1) ÍƼö(0) ±à¼­
ÕªÒª£º 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. N ÔĶÁÈ«ÎÄ
posted @ 2014-10-20 13:08 Grandyang ÔĶÁ(17803) ÆÀÂÛ(4) ÍƼö(0) ±à¼­
ÕªÒª£º Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [ ÔĶÁÈ«ÎÄ
posted @ 2014-10-18 13:05 Grandyang ÔĶÁ(16578) ÆÀÂÛ(14) ÍƼö(1) ±à¼­
ÕªÒª£º Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers ÔĶÁÈ«ÎÄ
posted @ 2014-10-18 04:17 Grandyang ÔĶÁ(9834) ÆÀÂÛ(2) ÍƼö(2) ±à¼­
ÕªÒª£º Given a non-negative index k where k ¡Ü 33, return the kth index row of the Pascal's triangle. Note that the row index starts from 0. In Pascal's trian ÔĶÁÈ«ÎÄ
posted @ 2014-10-17 16:52 Grandyang ÔĶÁ(12733) ÆÀÂÛ(2) ÍƼö(0) ±à¼­
ÕªÒª£º Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan, a canal: Pa ÔĶÁÈ«ÎÄ
posted @ 2014-10-17 04:09 Grandyang ÔĶÁ(21561) ÆÀÂÛ(5) ÍƼö(3) ±à¼­
ÕªÒª£º Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: E ÔĶÁÈ«ÎÄ
posted @ 2014-10-16 14:24 Grandyang ÔĶÁ(26733) ÆÀÂÛ(4) ÍƼö(2) ±à¼­
ÕªÒª£º http://www.cnblogs.com/mfryf/archive/2012/03/31/2426324.htmlÒ» ×÷Óý¨Á¢3Dµ½2DµÄÓ³Éä¹Øϵ£¬Ò»µ©±ê¶¨ºó£¬¶ÔÓÚÒ»¸öÉãÏñ»úÄÚ²¿²ÎÊýK(¹âÐĽ¹¾à±äÐβÎÊýµÈ£¬¼ò»¯µÄÇé¿öÊÇÖ»ÓÐf´íÇÐ=0,±ä±È=1£¬¹âÐÄλÖüòµ¥¼ÙÉèΪͼÏñÖÐÐÄ)£¬²ÎÊýÒÑÖª£¬ÄÇô¸ù¾Ý2... ÔĶÁÈ«ÎÄ
posted @ 2014-10-16 03:59 Grandyang ÔĶÁ(1320) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º Queuing:Ìύ̫¶àÁË£¬OJÎÞ·¨ÔÚµÚһʱ¼ä¸øËùÓÐÌá½»ÒÔÆÀÅнá¹û£¬ºóÃæÌá½»µÄ³ÌÐò½«ÔÝʱ´¦ÓÚÅŶÓ״̬µÈ´ýOJµÄÆÀÅС£²»¹ýÕâ¸ö¹ý³ÌÒ»°ã²»»áºÜ³¤¡£Compiling:ÄúÌá½»µÄ´úÂëÕýÔÚ±»±àÒë¡£Running:ÄúµÄ³ÌÐòÕýÔÚOJÉÏÔËÐС£Judging:OJÕýÔÚ¼ì²éÄú³ÌÐòµÄÊä³öÊÇ·ñÕýÈ·¡£Accepted(AC)... ÔĶÁÈ«ÎÄ
posted @ 2014-10-15 07:57 Grandyang ÔĶÁ(1510) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º IdQuestionDifficultyFrequencyData StructuresAlgorithms1Two Sum25array + setsort + two pointers2Add Two Numbers34linked listtwo pointers + math3Longest... ÔĶÁÈ«ÎÄ
posted @ 2014-10-15 05:40 Grandyang ÔĶÁ(4591) ÆÀÂÛ(0) ÍƼö(1) ±à¼­
ÕªÒª£º ÔÚÒÔÇ°½éÉÜIplImage½á¹¹µÄʱºò£¬ÓÐÒ»¸öÖØÒªµÄ²ÎÊý¡ª¡ªROI¡£ROIÈ«³ÆÊÇ¡±Region Of Interest¡±,¼´¸ÐÐËȤµÄÇøÓò¡£Êµ¼ÊÉÏ£¬ËüÊÇIPL/IPP£¨ÕâÁ½¸öÊÇInterµÄ¿â£©½á¹¹IplROIµÄʵÀý¡£IplROI°üº¬xOffset¡¢yOffset¡¢height¡¢widthºÍcoi³ÉÔ±±äÁ¿... ÔĶÁÈ«ÎÄ
posted @ 2014-10-10 06:20 Grandyang ÔĶÁ(3564) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º £¨OpenCV¶ÁÈ¡ÊÓƵ¡¢OpenCVÌáÈ¡ÊÓƵÿһ֡¡¢Ã¿Ò»Ö¡Í¼Æ¬ºÏ³ÉеÄAVIÊÓƵ£©CvCapture ÊÇÊÓƵ»ñÈ¡½á¹¹ ±»ÓÃÀ´×÷ΪÊÓƵ»ñÈ¡º¯ÊýµÄÒ»¸ö²ÎÊý ±ÈÈç CvCapture* cap; IplImage* cvQueryFrame( cap ); ´ÓÉãÏñÍ·»òÕßÎļþÖÐץȡ²¢·µ»ØÒ»Ö¡¡ª¡ª¡ª¡ª¡ª¡ª¡ª¡ª... ÔĶÁÈ«ÎÄ
posted @ 2014-10-09 06:56 Grandyang ÔĶÁ(6635) ÆÀÂÛ(1) ÍƼö(1) ±à¼­
ÕªÒª£º ½ñÌìÍƵ¼¹«Ê½£¬·¢ÏÖ¾ÓÈ»ÓжԾØÕóµÄÇóµ¼£¬¿ñº¹--ÍêÈ«²»»á¡£²»¹ý»¹ºÃÍøÉÏÓÐÈË×ܽáÁË¡£ºðºð£¬¸Ï½ô°á¹ýÀ´Êղر¸·Ý¡£»ù±¾¹«Ê½£ºY = A * X --> DY/DX = A'Y = X * A --> DY/DX = AY = A' * X * B --> DY/DX = A * B'Y = A' * X' ... ÔĶÁÈ«ÎÄ
posted @ 2014-10-08 12:28 Grandyang ÔĶÁ(3614) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º Ö¸ÁÄÜÓ¦ÓÃʵÀýLB´Ó´æ´¢Æ÷ÖжÁÈ¡Ò»¸ö×Ö½ÚµÄÊý¾Ýµ½¼Ä´æÆ÷ÖÐLB R1, 0(R2)LH´Ó´æ´¢Æ÷ÖжÁÈ¡°ë¸ö×ÖµÄÊý¾Ýµ½¼Ä´æÆ÷ÖÐLH R1, 0(R2)LW´Ó´æ´¢Æ÷ÖжÁÈ¡Ò»¸ö×ÖµÄÊý¾Ýµ½¼Ä´æÆ÷ÖÐLW R1, 0(R2)LD´Ó´æ´¢Æ÷ÖжÁÈ¡Ë«×ÖµÄÊý¾Ýµ½¼Ä´æÆ÷ÖÐLD R1, 0(R2)L.S´Ó´æ´¢Æ÷ÖжÁÈ¡µ¥¾«¶È¸¡... ÔĶÁÈ«ÎÄ
posted @ 2014-10-08 09:37 Grandyang ÔĶÁ(7366) ÆÀÂÛ(0) ÍƼö(1) ±à¼­
ÕªÒª£º Git global setup: gitÈ«¾Ö½¨Á¢git config --global user.name "Your Name"git config --global user.email "your.name@gmail.come"Create Repository: ½¨Á¢²Ö¿âmkdir yo... ÔĶÁÈ«ÎÄ
posted @ 2014-09-30 07:48 Grandyang ÔĶÁ(1225) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º Ô­ÎĵØÖ·£ºhttp://www.vogella.com/tutorials/AndroidListView/article.html1.Android and Lists1.1.Using lists in AndroidThe display of elements in a list is a ... ÔĶÁÈ«ÎÄ
posted @ 2014-09-24 10:25 Grandyang ÔĶÁ(2984) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º ×÷ÕߣºGangWang³ö´¦£ºhttp://www.cnblogs.com/GnagWang/¼ÇÏÂÀ´£¬ºÜÖØÒª¡£JavaÓïÑԵĹؼü×Ö£¬µ±ËüÓÃÀ´ÐÞÊa56爆大奖在线娱乐»¸ö·½·¨»òÕßÒ»¸ö´úÂë¿éµÄʱºò£¬Äܹ»±£Ö¤ÔÚͬһʱ¿Ì×î¶àÖ»ÓÐÒ»¸öÏß³ÌÖ´ÐиöδúÂë¡£ Ò»¡¢µ±Á½¸ö²¢·¢Ï̷߳ÃÎÊͬһ¸ö¶ÔÏóobjectÖеÄÕâ¸ösynchronized(... ÔĶÁÈ«ÎÄ
posted @ 2014-09-21 12:31 Grandyang ÔĶÁ(429) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º SingletonºÍDouble-Checked LockingÉè¼Æģʽ,·Ö±ðÖ¸µÄÊǵ¥ÀýģʽºÍË«Öؼì²éËøģʽ£¬ËüÃǶ¼¿ÉÒÔÓÃÓÚÈ·±£Ä³¸öÀàÖ»ÓÐÒ»¸ö¶ÔÏóʵÀý»¯¡£Á½¸öģʽµÄÇø±ðÔÚÓÚ£ºSingletonģʽÓÃÔÚµ¥Ïß³ÌÓ¦ÓóÌÐòÖУ¬¶øDouble-Checked LockingģʽÓÃÓÚ¶àÏß³Ìģʽ¡£Ò»¡¢Single... ÔĶÁÈ«ÎÄ
posted @ 2014-09-21 11:58 Grandyang ÔĶÁ(615) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÕªÒª£º ÏÂÔغͰ²×° OpenCV 2.1.02¡¢Ìí¼Ó¿âÎļþ£º´ò¿ªVS 2008£¬Ñ¡Ôñ²Ëµ¥£ºTools->options->Projects and Solutions >VC++ DirectoriesÊ×ÏÈ´Ó¡°Show directories for¡±ÖеÄÏÂÀ­ÁбíÖÐÑ¡Ôñ¡°library files¡±.È»ºóÔÚ... ÔĶÁÈ«ÎÄ
posted @ 2014-09-20 04:46 Grandyang ÔĶÁ(565) ÆÀÂÛ(0) ÍƼö(0) ±à¼­
ÉÏÒ»Ò³ 1 ¡¤¡¤¡¤ 40 41 42 43 44
Fork me on GitHub