zerofeeling12的专栏

题目：Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of th

题目：Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.题解：

题目：Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant

题目：给定一段长度为n英寸的钢条

题目：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right

题目：You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?题解：可以由递推关系得出

class Solution {public: bool isPalindrome(int x) { if( x < 0 ) return false; int count = 1; int p = x; while( p/10 != 0){ count++; p /= 10; } for(int i = 0; i < count/

Title：Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u

题目：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

最近一直在看LDA，等看的明白了，整理一篇文档出来。虽然现在有很多关于LDA的深入浅出的文章，但是觉得还是自己整理的比较易于自己理解

给定正整数n，你的任务是用最少的操作次数把序列1, 2, 3 ... n 中的所有数都变为0。 每次操作可以从序列中选择一个或多个整数，同时减去一个相同的正整数。比如，1,2,3可以把2和3同时减小2，得到1,0,1.【输入格式】输入包含多组数据。每组仅一行，为正整数n（n 【输出格式】对于每组数据，输出最少操作次数。【题解】每次减去（n/2+1）。这样剩下的一部分

题目：Implement int sqrt(int x).Compute and return the square root of x.