摘要:
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() Ge 阅读全文
posted @ 2018-02-28 18:14
Beserious
阅读(135)
评论(0)
推荐(0)
摘要:
Reverse a singly linked list. 思路:递归,每次保存一下上一个节点用来构造反转后的链表。 非递归,需要多记录两个值. 阅读全文
posted @ 2018-02-28 18:09
Beserious
阅读(95)
评论(0)
推荐(0)
摘要:
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 occurrenc 阅读全文
posted @ 2018-02-28 16:15
Beserious
阅读(113)
评论(0)
推荐(0)
摘要:
Remove all elements from a linked list of integers that have value val. 思路:声明两指针,类似快慢指针,快指针遇到val时跳过,直到值不是val这时修改慢指针的next为快指针,慢指针移到快指针这个位置。 阅读全文
posted @ 2018-02-28 16:00
Beserious
阅读(85)
评论(0)
推荐(0)
摘要:
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
posted @ 2018-02-28 15:15
Beserious
阅读(110)
评论(0)
推荐(0)
摘要:
Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), retur 阅读全文
posted @ 2018-02-28 15:10
Beserious
阅读(88)
评论(0)
推荐(0)
摘要:
Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. Not 阅读全文
posted @ 2018-02-28 15:08
Beserious
阅读(306)
评论(0)
推荐(0)
摘要:
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 intege 阅读全文
posted @ 2018-02-28 15:07
Beserious
阅读(117)
评论(0)
推荐(0)
摘要:
Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at 阅读全文
posted @ 2018-02-28 15:03
Beserious
阅读(120)
评论(0)
推荐(0)
摘要:
We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1. Now, given an integer arra 阅读全文
posted @ 2018-02-28 14:54
Beserious
阅读(111)
评论(0)
推荐(0)
浙公网安备 33010602011771号