Just Do IT

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 ext

Linked List Cycle Total Accepted: 17148 Total Submissions: 49300My SubmissionsGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra sp

Single Number II Total Accepted: 14472 Total Submissions: 44420My SubmissionsGiven an array of integers, every element appears three times except for one. Find that single one.Note:Y

Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti

Search Insert Position Total Accepted: 14091 Total Submissions: 41005My SubmissionsGiven a sorted array and a target value, return the index if the target is found. If not, return the in

Same Tree Total Accepted: 16072 Total Submissions: 38790My SubmissionsGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal i

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti

LeetCode--online portal for IT interviewhttp://leetcode.com

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f

//#include #include #include //using namespace std;//const int MAXN=10;//int Stack[MAXN];stack s;class Solution {public: int getNumber(int x) { //int lengthOfStack=0;

Binary Tree Level Order Traversal Total Accepted: 12441 Total Submissions: 40879My SubmissionsGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left t

对于本题，想到一个中序遍历后，判别是否为回文串的方法，却WA多次class Solution {public: vector vectorValue; void inOrder(TreeNode* root) { if(root!=NULL) { inOrder(root->left);

本文先参考了http://www.cnblogs.com/remlostime/archive/2012/11/12/2766608.html法一，递归/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; *

大概的题意是，给出一个单向链表的头节点，求这么链表是否有环。有环的定义是，链表的尾节点指向了链接中间的某个节点。单链表的定义如下：1234structNode {  Node(): next(NULL) {}  Node *next;};这道题目还有一些变种，比如求链接的长度，求链表的尾节点

Binary Tree Preorder Traversal Total Accepted: 18022 Total Submissions: 51784My SubmissionsGiven a binary tree, return the preorder traversal of its nodes' values.For example:Given b