Fork me on GitHub

10 2018 档案

转载----C/C++ 中 const 修饰符用法总结
摘要：感谢原创作者，写的好详细。不忍错过，所以转载过来了。。。 原文地址： https://www.cnblogs.com/icemoon1987/p/3320326.html 在这篇文章中，我总结了一些C/C++语言中的 const 修饰符的常见用法，供大家参考。 const 的用法，也是技术性面试中常 阅读全文
posted @ 2018-10-09 20:54 hellowOOOrld 阅读(479) 评论(0) 推荐(0)
使用SSD目标检测c++接口编译问题解决记录
摘要：本来SSD做测试的Python接口用起来也是比较方便的，但是如果部署集成的话，肯定要用c++环境，于是动手鼓捣了一下。 编译用的cmake，写的CMakeList.txt，期间碰到一些小问题，简单记录一下问题以及解决方法。 当然前提是你本地的caffe环境没啥问题。各种依赖都安好了。。 1.erro 阅读全文
posted @ 2018-10-09 11:51 hellowOOOrld 阅读(3769) 评论(0) 推荐(0)
[leetcode-897-Increasing Order Search Tree]
摘要：Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and o 阅读全文
posted @ 2018-10-08 23:58 hellowOOOrld 阅读(347) 评论(0) 推荐(0)
[leetcode-884-Uncommon Words from Two Sentences]
摘要：We are given two sentences A and B. (A sentence is a string of space separated words. Each word consists only of lowercase letters.) A word is uncommo 阅读全文
posted @ 2018-10-07 23:54 hellowOOOrld 阅读(247) 评论(0) 推荐(0)
[leetcode-876-Middle of the Linked List]
摘要：Given a non-empty, singly linked list with head node head, return a middle node of linked list. If there are two middle nodes, return the second middl 阅读全文
posted @ 2018-10-07 22:02 hellowOOOrld 阅读(151) 评论(0) 推荐(0)
[leetcode-905-Sort Array By Parity]
摘要：Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A. You may re 阅读全文
posted @ 2018-10-07 16:50 hellowOOOrld 阅读(291) 评论(0) 推荐(0)
[leetcode-917-Reverse Only Letters]
摘要：Given a string S, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positi 阅读全文
posted @ 2018-10-07 13:45 hellowOOOrld 阅读(428) 评论(0) 推荐(0)
[leetcode-908-Smallest Range I]
摘要：Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add x to A[i]. After this process, we have some array B 阅读全文
posted @ 2018-10-07 12:42 hellowOOOrld 阅读(161) 评论(0) 推荐(0)
[leetcode-915-Partition Array into Disjoint Intervals]
摘要：Given an array A, partition it into two (contiguous) subarrays left and right so that: Every element in left is less than or equal to every element in 阅读全文
posted @ 2018-10-07 00:15 hellowOOOrld 阅读(157) 评论(0) 推荐(0)
[leetcode-914-X of a Kind in a Deck of Cards]
摘要：In a deck of cards, each card has an integer written on it. Return true if and only if you can choose X >= 2 such that it is possible to split the ent 阅读全文
posted @ 2018-10-06 15:10 hellowOOOrld 阅读(678) 评论(0) 推荐(0)