zhanglaplace

input: "data"
input_dim: 1
input_dim: 3
input_dim: 224
input_dim: 224
layer {
  name: "conv1"
  type: "Convolution"
  bottom: "data"
  top: "conv1"

zhanglaplace

name: "MOBILENET"
#  transform_param {
#    scale: 0.017
#    mirror: false
#    crop_size: 224
#    mean_value: [103.94,116.78,123.68]
#  }
input: "data"
input_dim: 1
input_dim: 3

zhanglaplace

name: "VGG_ILSVRC_16_layers"
layer {
  name: 'input-data'
  type: 'Python'
  top: 'data'
  top: 'im_info'
  top: 'gt_boxes'
  python_param {
    module: 'roi_data_layer.layer'
    layer: 'RoIDataLayer'

zhanglaplace

name: "multi_patch_layers"

layer {
  name: "left_eye"
  type: "Input"
  top: "left_eye"
  input_param { shape: { dim: 128 dim: 64 dim: 30 dim: 30 } }
}

layer {

zhanglaplace

name: "DENSENET_201"
input: "data"
input_dim: 1
input_dim: 3
input_dim: 224
input_dim: 224
layer {
  name: "conv1"
  type: "Convolution"
  bottom: "data"

zhanglaplace

name: "DENSENET_169"
input: "data"
input_dim: 1
input_dim: 3
input_dim: 224
input_dim: 224
layer {
  name: "conv1"
  type: "Convolution"
  bottom: "data"

zhanglaplace

name: "DENSENET_161"
input: "data"
input_dim: 1
input_dim: 3
input_dim: 224
input_dim: 224
layer {
  name: "conv1"
  type: "Convolution"
  bottom: "data"

zhanglaplace

#ifndef _UTILS_H__
#define _UTILS_H__
#include <iostream>
#include <map>
#include <algorithm>
#include <opencv2/opencv.hpp>
#include <fstream>

typedef std::map<float, int> MAP;

zhanglaplace

/*******************************************************************
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
*******************************************************************/
/**
 * Definition for singly-linked list.

zhanglaplace

/*********************************
度度熊想去商场买一顶帽子，商场里有N顶帽子，有些帽子的价格可能相同。度度熊想买一顶价格第三便宜的帽子，问第三便宜的帽子价格是多少？ 
输入描述:
首先输入一个正整数N（N <= 50），接下来输入N个数表示每顶帽子的价格（价格均是正整数，且小于等于1000）
输出描述:
如果存在第三便宜的帽子，请输出这个价格是多少，否则输出-1
输入例子1:
10
10 10 10 10 20 20 30 30 40 40
输出例子1: