tracyliang223的专栏

COPY FROM:http://www.cnblogs.com/x1957/p/3485053.html 做个LRU，算法挺简单的。。。 而且好像用处也挺广的（？），用的比较广的一个cache算法 比如我cache只有4这么大，现在有很多元素1,2,2,4,2,5,3 cache                  income:1 1 cache      

题目： Generate Parentheses  Total Accepted: 11899 Total Submissions: 38480My Submissions Given n pairs of parentheses, write a function to generate all combinations of well-formed par

COPY FROM：http://blog.csdn.net/zhouworld16/article/details/14121477 题目要求： The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to displ

COPY FROM:http://blog.csdn.net/yutianzuijin/article/details/11499917 这是我做的第二个leetcode题目，一开始以为和第一个一样很简单，但是做的过程中才发现这个题目非常难，给人一种“刚上战场就踩上地雷挂掉了”的感觉。后来搜了一下leetcode的难度分布表（leetcode难度及面试频率）才发现，该问题是难度为5的问题

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo

//Reverse digits of an integer. //Example1: x = 123, return 321 //Example2: x = -123, return -321 //Have you thought about this? //Here are some good questions to ask before coding. Bonus points for y

Sort List:  Total Accpeptt Sort a linked list in O(n log n) time using constant space complexity.

COPY FROM: http://blog.csdn.net/jiadebin890724/article/details/23305449 Two Sum   Total Accepted: 16363 Total Submissions: 87273My Submissions Given an array of integers, find two n

题目： Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it wi

//For example, //Given s = "the sky is blue", //return "blue is sky the".

第一种方法代码比第二种长：

COPY FROM： 比I麻烦点的就是找到循环开始点TAT I只是判断是否循环。要求不使用额外空间（不然hash就可以了 按I的思路，我们又慢指针S和快指针F。。。F走两步，S走一步。。。若有环，必定相遇。 画个图（很丑勿喷 假设在红色凸起的地方相遇了。 F走的路程应该是S的两倍 S = x + y F = x + y + z +