zgljl2012

问题描述 Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time and O(1) space? 问题分析 使用快慢指针找到中点，然后将后半截链表逆置，再将后半截与前半截进行比较，如果有一个数不相等则返回false；否则返回true。 代码

问题描述 Implement the following operations of a queue using stacks. * push(x) -- Push element x to the back of queue. * pop() -- Removes the element from in front of queue. * peek() --

问题描述 Given an integer, write a function to determine if it is a power of two. 判断一个数是否为2的次方数 思路 1. 当n>1时迭代，如果n%2!=0，即n不是2的倍数，直接false，否则令n=n/2，继续下一轮迭代。结束循环后，若n=1则为次方数。

Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original tweet by Max Howell: > Google: 90%

问题描述 Implement the following operations of a stack using queues. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top() -- Get the top

Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defined by its bottom left corner and top right corner as shown in the figure. Rectangle Area

问题描述 Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute

问题描述 Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false

问题描述 Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must

问题描述 Description: Count the number of prime numbers less than a non-negative number, n. 点击查看问题 [https://leetcode.com/problems/count-primes/] 问题分析 筛选法求素数，参考这篇文章【算法】普通方法和筛选法求素数 [http://www.zgljl2012.com/suan-fa-pu-tong-fang-fa-he-shai-xuan-fa-qiu-su-shu/] ，这道题用普通方法求素数会超时，只能用筛选法。 代码

问题描述 Reverse a singly linked list. 问题分析 链表反转问题。从第二个节点开始，不断把next节点加到head前面。 代码 class Solution { public: ListNode* reverseList(ListNode* head) { ListNode* p = head; ListNode* q = 0; if(head==0) return 0; while(p->next) { q

问题描述 Remove all elements from a linked list of integers that have value val. Example Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6 Return: 1

问题描述 Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum