<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[IMISSHOT的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/IMISSHOT</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; IMISSHOT]]></copyright><item><title><![CDATA[win10+opencv4.01+opencv_contrib+vs2017编译过程]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/102653027</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/102653027</guid><author>IMISSHOT</author><pubDate>Sun, 20 Oct 2019 22:02:16 +0800</pubDate><description><![CDATA[intuition
虽然写的是win10+opencv4.01+opencv_contrib的编译过程，但各个系统各个版本大同小异，都可以作为参考。下面是编译过程。
第一步，准备工作
首先安装cmake，下载地址在这：https://cmake.org/download/，之后去github下载opencv和对应版本的opencv_contrib，opencv下载地址:https://github...]]></description><category></category></item><item><title><![CDATA[1004. 成绩排名 (20)]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79122441</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79122441</guid><author>IMISSHOT</author><pubDate>Sun, 21 Jan 2018 19:53:17 +0800</pubDate><description><![CDATA[读入n名学生的姓名、学号、成绩，分别输出成绩最高和成绩最低学生的姓名和学号。输入格式：每个测试输入包含1个测试用例，格式为第1行：正整数n 
  第2行：第1个学生的姓名 学号 成绩 
  第3行：第2个学生的姓名 学号 成绩 
  … … … 
  第n+1行：第n个学生的姓名 学号 成绩 
其中姓名和学号均为不超过10个字符的字符串，成绩为0到100之间的一个整数，这里保证在一组测试用例中没有两]]></description><category></category></item><item><title><![CDATA[1003. 我要通过！(20)]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79122430</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79122430</guid><author>IMISSHOT</author><pubDate>Sun, 21 Jan 2018 19:52:08 +0800</pubDate><description><![CDATA[“答案正确”是自动判题系统给出的最令人欢喜的回复。本题属于PAT的“答案正确”大派送 —— 只要读入的字符串满足下列条件，系统就输出“答案正确”，否则输出“答案错误”。得到“答案正确”的条件是：
字符串中必须仅有P, A, T这三种字符，不可以包含其它字符；
任意形如 xPATx 的字符串都可以获得“答案正确”，其中 x 或者是空字符串，或者是仅由字母 A 组成的字符串；
如果 aPbTc 是正确的]]></description><category></category></item><item><title><![CDATA[1002. 写出这个数 (20)]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79122416</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79122416</guid><author>IMISSHOT</author><pubDate>Sun, 21 Jan 2018 19:50:34 +0800</pubDate><description><![CDATA[读入一个自然数n，计算其各位数字之和，用汉语拼音写出和的每一位数字。输入格式：每个测试输入包含1个测试用例，即给出自然数n的值。这里保证n小于10^100。输出格式：在一行内输出n的各位数字之和的每一位，拼音数字间有1 空格，但一行中最后一个拼音数字后没有空格。输入样例： 
1234567890987654321123456789 
输出样例： 
yi san wu#include<iostream]]></description><category></category></item><item><title><![CDATA[1001. 害死人不偿命的(3n+1)猜想 (15)]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79122407</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79122407</guid><author>IMISSHOT</author><pubDate>Sun, 21 Jan 2018 19:48:46 +0800</pubDate><description><![CDATA[卡拉兹(Callatz)猜想：对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把(3n+1)砍掉一半。这样一直反复砍下去，最后一定在某一步得到n=1。卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时耶鲁大学师生齐动员，拼命想证明这个貌似很傻很天真的命题，结果闹得学生们无心学业，一心只证(3n+1)，以至于有人说这是一个阴谋，卡拉兹是在蓄意延缓美国数学界教学与科研的进]]></description><category></category></item><item><title><![CDATA[A+B problem]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79104234</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79104234</guid><author>IMISSHOT</author><pubDate>Fri, 19 Jan 2018 10:52:32 +0800</pubDate><description><![CDATA[leetcode 开始收费了，开始转战lintcode。

Write a function that add two numbers A and B. You should not use + or any arithmetic operators. 

Clarification

Are a and b both 32-bit integers?

Yes.


Can I use bit]]></description><category></category></item><item><title><![CDATA[141. Linked List Cycle]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101914</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101914</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 23:38:09 +0800</pubDate><description><![CDATA[Given a linked list, determine if it has a cycle in it.

Follow up: 
Can you solve it without using extra space?

判断一个链表是否有环。条件是能否用O（1）的空间复杂度解决这个问题。既然不让我们用多余的空间，那么我们首先想到的是遍历这个链表，我们维持两个指针，一个快，一个慢，如果有环的]]></description><category></category></item><item><title><![CDATA[122. Best Time to Buy and Sell Stock II]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101809</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101809</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 23:16:21 +0800</pubDate><description><![CDATA[Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one]]></description><category></category></item><item><title><![CDATA[113. Path Sum II]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101649</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101649</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 22:46:35 +0800</pubDate><description><![CDATA[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 = 22,



return 


给一个二叉树和一个数字sum，让你找出所有路径和为su]]></description><category></category></item><item><title><![CDATA[110. Balanced Binary Tree]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101494</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101494</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 22:22:16 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[Binary Tree Level Order Traversal]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101202</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79101202</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 21:49:56 +0800</pubDate><description><![CDATA[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,null,null,15,]]></description><category></category></item><item><title><![CDATA[Convert Sorted Array to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79096818</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79096818</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 15:26:37 +0800</pubDate><description><![CDATA[Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the]]></description><category></category></item><item><title><![CDATA[<T110>Balanced Binary Tree]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79096040</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79096040</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 14:38:09 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[Path Sum]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79094965</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79094965</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 13:21:32 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[<T111>  Minimum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79094807</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79094807</guid><author>IMISSHOT</author><pubDate>Thu, 18 Jan 2018 13:04:00 +0800</pubDate><description><![CDATA[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 leaf node.

这道题的目的就是求二叉树的最小高度. 
和求二叉树高度不同的是，它需要判断每]]></description><category></category></item><item><title><![CDATA[<T121>Best Time To Buy And Sell Stack I]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79083977</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79083977</guid><author>IMISSHOT</author><pubDate>Wed, 17 Jan 2018 12:49:45 +0800</pubDate><description><![CDATA[say you have an array for witch the  i th element is the price of a given stock on day i. 
if you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),]]></description><category></category></item><item><title><![CDATA[<T125>Valid Palindrome]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79079471</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79079471</guid><author>IMISSHOT</author><pubDate>Tue, 16 Jan 2018 21:32:51 +0800</pubDate><description><![CDATA[Given a string, determine if it is a palindrome. considering only alphanumeric characters and ignoring cases.

Notes: 
Have you consider the string might be empty?



class Solution{
    bool isPalind]]></description><category></category></item><item><title><![CDATA[Single Number]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79073555</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79073555</guid><author>IMISSHOT</author><pubDate>Tue, 16 Jan 2018 13:04:53 +0800</pubDate><description><![CDATA[Given an array of integers, every element appears twice except for one. find that single one. 
Note: 
Your algorithm should have a linear runtime complexity. Could you implement it without using extra]]></description><category></category></item><item><title><![CDATA[Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79070171</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79070171</guid><author>IMISSHOT</author><pubDate>Tue, 16 Jan 2018 00:01:42 +0800</pubDate><description><![CDATA[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 fastest leaf node. 


/*
struct TreeNode{
    int val;]]></description><category></category></item><item><title><![CDATA[Symmetric Tree]]></title><link>https://blog.youkuaiyun.com/IMISSHOT/article/details/79070136</link><guid>https://blog.youkuaiyun.com/IMISSHOT/article/details/79070136</guid><author>IMISSHOT</author><pubDate>Mon, 15 Jan 2018 23:53:35 +0800</pubDate><description><![CDATA[Given a binary tree, check whether it is a mirror of itself.  
For example, the binary tree[1,2,2,3,4,4,3] is a symmetric tree. 
 
Notes 
bonus points if you could solve it both recursively and iterat]]></description><category></category></item></channel></rss>