Skip to content

Instantly share code, notes, and snippets.

View lambdaq's full-sized avatar
🌀
这里还可以打广告

lambdaq lambdaq

🌀
这里还可以打广告
  • undefined
  • undefined
View GitHub Profile
@lambdaq
lambdaq / elevatorsaga.js
Last active October 8, 2016 05:21
lambdaq's solution to elevatorsaga
{
init: function(elevators, floors) {
// where ppl wanna get in elevator
var upFloors = floors.map(function(){
return 0
})
var downFloors = floors.map(function(){
return 0
});
floors.forEach(function(floor){
@lambdaq
lambdaq / readme.md
Created September 2, 2015 09:00
combination 14 problem

given range(1, 15), find a 7x7 matrix that:

  • each row is list of tuples like [(1, 2), (3, 4), (5, 6), (7, 8), (9, 10), (11, 12), (13, 14))]
  • always n[0]<n[1] for every n in all tuples
  • every element in the tuple must be unique in the row
  • every tuple in the whole matrix must be unique.
@lambdaq
lambdaq / gist:2364529
Created April 12, 2012 04:04
CHINANET 2012-04-12 problem
Keys: Help Display mode Restart statistics Order of fields quit
Packets Pings
Host Loss% Snt Last Avg Best Wrst StDev
1.
2.
3.
4.
5.
6.