yinjun12 Goto Github PK

2015-

2015阿里巴巴校招笔试题

996.icu

Repo for counting stars and contributing. Press F to pay respect to glorious developers.

absolutesortedsequence

store arrange with sequences

activitydetected

C++和opencv实现运动检测并保存运动录像

binary-tree-zigzag-level-order

Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).

book

Deep Learning 101 with PaddlePaddle

bp-

coinchange

combination-sum

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

communication-model

simulate communication in school with two way

communicationmodel

school communication model

construct-binary-tree-

Given inorder and postorder traversal of a tree, construct the binary tree.

datastruct-six-chapter

the answers of questions in data struct sixth chapter

dectect-activities

find-missing-number

the algorithm can find the number that is missing in the contianer

gameoflive

generate-parentheses

heap

contains: create min heap, insert a value to min heap, delete a val from heap; the maxHeap's operation seem like minheap

introduction-to-algorithms

some algorithms

java

27天成为Java大神

javaeetest

Spring、SpringMVC、MyBatis、Spring Boot案例

largestdivisiblesubset

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0. If there are multiple solutions, return any subset is fine.

letter-combinations-of-a-photo-number

Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below.

leveldb

LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values.

lowest-common-ancestor-of-bintary-tree

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

maxpalidormoesequence

maze

path-sum

polyomial-operation

processer-and-consumer

process Synchronization and mutex