摘要：
这篇文章主要用来记录学习 DynamoDB这篇paper的笔记。paper link: http://www.allthingsdistributed.com/files/amazon-dynamo-sosp2007.pdf 因为现在所在公司的后台是run 在 AWS上，所以有很多地方用到了Dyna 阅读全文
posted @ 2017-11-05 04:58
逸朵
阅读(2081)
评论(0)
推荐(0)
摘要：
Scenario： 一个类似ticket master的网站。 说某个时间段开放某明星演唱会订票，大概会同时有500K QPS 的访问量，一共只有50K张票。 订票的过程是用户打开订票网页（不用考虑认证等问题），填一个text box说要订几张票，然后click一个button就打开一个page，那 阅读全文
posted @ 2017-11-04 12:13
逸朵
阅读(648)
评论(0)
推荐(0)
摘要：
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input: "babad" Output: "b 阅读全文
posted @ 2017-11-04 12:06
逸朵
阅读(146)
评论(0)
推荐(0)
摘要：
Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the leng 阅读全文
posted @ 2017-11-04 11:58
逸朵
阅读(129)
评论(0)
推荐(0)
摘要：
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 contai 阅读全文
posted @ 2017-11-04 11:56
逸朵
阅读(96)
评论(0)
推荐(0)
摘要：
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the lo 阅读全文
posted @ 2017-11-04 11:49
逸朵
阅读(119)
评论(0)
推荐(0)
摘要：
We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11). N 阅读全文
posted @ 2017-11-04 11:36
逸朵
阅读(260)
评论(0)
推荐(0)
浙公网安备 33010602011771号