2017年09月_JensLee

12月 09月 08月 07月 06月 05月 04月 01月

原创 217. Contains Duplicate

题目描述：Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if e

2017-09-29 21:37:26 394

原创 442. Find All Duplicates in an Array

题目描述：Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appeartwice and others appear once.Find all the elements that appear twice in this array.Could you do it with

2017-09-29 08:58:49 396

原创 374. Guess Number Higher or Lower

题目要求：We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the numb

2017-09-28 23:31:31 411

原创 110. Balanced Binary Tree

题目描述：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 ofevery node nev

2017-09-28 21:09:23 413

原创折半查找

递归算法：int binarysearch(int *a,int key,int low,int high){ if(low>high) return 0; int mid = (low+high)/2; if(a[mid]==key) return mid; if(a[mid]>key) binarys

2017-09-28 21:01:51 387

原创 226. Invert Binary Tree

题目描述：Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original tweet by

2017-09-28 08:45:11 373

原创 404. Sum of Left Leaves

题目描述：Find the sum of all left leaves in a given binary tree.Example: 3 / \ 9 20 / \ 15 7There are two left leaves in the binary tree, with values 9 and 15 respectively. Re

2017-09-28 08:08:56 347

原创 637. Average of Levels in Binary Tree

题目描述：Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.Example 1:Input: 3 / \ 9 20 / \ 15 7Output: [3, 14.5, 11]

2017-09-27 21:08:16 343

原创 671. Second Minimum Node In a Binary Tree

题目描述Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactlytwo or zero sub-node. If the node has two sub-nodes, then this

2017-09-27 19:50:12 336

原创 155. Min Stack

class MinStack {private: stack s1; stack s2;public: void push(int x) { s1.push(x); if(s2.empty()||x s2.push(x); } void pop() {

2017-09-23 22:14:48 326

原创 20.Valid Parentheses 栈的应用：括号匹配

十分简单的括号匹配，用栈来操作就可以了#define max_size 1000001class Solution {public: typedef struct SqStack{ int top; char data[max_size]; }Stack; void Init_Stack(St

2017-09-23 21:06:05 385

原创 485_Max_Consecutive_Ones_Easy.c

/*Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are consecutive

2017-09-09 19:59:16 361

原创 476_Number_Complement

/*Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note: The given integer is guaranteed to fit within the range

2017-09-09 19:58:41 323

原创 461_Hamming_Distance

/*The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.*/#define max 1010

2017-09-09 19:56:07 358

原创 455. Assign Cookies

/*Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a

2017-09-09 19:53:50 381

原创 453. Minimum Moves to Equal Array Elements

/*Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.Example:Input:[1,2,3]

2017-09-09 19:52:33 340

原创 441_ Arranging_Coins

/*441. Arranging CoinsYou have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.Given n, find the total number of full staircase rows

2017-09-09 19:50:19 353

原创 434_Number_of_Segments_in_a_String

/*Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does not contain any non-printable characters.

2017-09-09 19:47:50 357

原创 414. Third Maximum Number

/*Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Input: [3, 2,

2017-09-09 19:44:34 399

原创巧用二重积分的积分中值定理

2017-09-09 16:57:52 49301 3

原创椭圆一般式方程面积求解

2017-09-09 16:24:54 18155 2

bert-base-uncased

Can‘t load tokenizer for ‘bert-base-uncased‘ 用于解决上述问题的资源包，在github上面下载的下来的。下载完了解压缩。之后在项目工程新建一个文件夹，命名为bert-base-uncased 之后把解压缩的文件放到bert-base-uncased文件夹里面，重新运行就可以了。

2024-08-19

EVA-GCN-main.zip

2021年CVPR《EVA-GCN: Head Pose Estimation Based on Graph Convolutional Networks》代码

2021-07-01

导师评价网信息2021

导师评价网所有导师，15000条信息

2021-01-16

biwi下载地址.txt

数据库中将近15000张照片，其中角度包含有：yaw:±75度，pitch:±60度，roll:±50度。 2.由Kinect v2设备采集。 3.24个序列，包含20个人（6女14男）。以大约一米的距离转动头部。

2020-05-05

300w-lp下载地址.txt

300W-LP主要包含8个数据库： 'AFW', 'AFW_Flip', 'HELEN', 'HELEN_Flip', 'IBUG', 'IBUG_Flip','LFPW','LFPW_Flip' 数据库特色：大多数算法都是为中小型姿态（45度以下）的人脸设计的，缺乏在高达90度的大型姿态下对齐人脸的能力。本数据库包含大角度姿态。

2020-05-05