LeetCode练习-简单卷

题目链接： LeetCode练习-简单卷。

1、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 extra memory?

分析：根据异或运算特点：两个相同的数进行异或，结果为0。

class Solution {
public:
    int singleNumber(int A[], int n) {
        int res = 0;
        for(int i = 0;i<n;++i)
            res^=A[i];
        return res;
    }
};

类似的题目有“只出现一次的数字有2个，其它数字都出现了两次，求出这两个数”。求解链接：这里。

2、 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 tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode *root) {
        if(root==NULL)
            return 0;
        int nl = maxDepth(root->left);
        int nr = maxDepth(root->right);
        return (nl>nr)?(nl+1):(nr+1);
    }
};

3、 Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

分析：

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode *p, TreeNode *q) {
        if(p==NULL&&q==NULL)
            return true;
        else if(p==NULL||q==NULL)
            return false;
        return (p->val==q->val)&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
    }
};