名场聚散多高富，沧海浮沉一屌丝

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 using e

class Solution{public: int maxArea(vector& height) { /*int i, j, mx = 0; for(i = 0; i < height.size(); i++) { for(j = i + 1; j < height.size(); j++)

class Solution{public: string longestPalindrome(string s) { string sNew, longest; int i, j = 0, iMax = 1, id = 1; int p[2222]; memset(p, 0, sizeof(p));

class Solution{public: int lengthOfLongestSubstring(string s) { int i, j, k, len, preLen = 0, maxLen = 0; map m; map :: iterator it; for(i = 0; i < s.size();

class Solution{public: struct node { int x, heightIndex; bool leftOrRight; node(int _x, int _heightIndex, bool _leftOrRight):x(_x), heightIndex(_heightIndex), leftOrR

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a

Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.class Solution {public: int trailingZeroes(int n) { int c

Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, w

Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node./** * Definition for binary tre

class Solution{public: string str(int x, int y) { string s; int i; if(x == 0) { if(y > 0 && y < 4) { for(i = 0; i < y;