- 博客(12)
- 资源 (28)
- 问答 (1)
- 收藏
- 关注
原创 Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the
2015-08-03 20:57:51 311
原创 Implement Queue using Stacks
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() -- Get the front element.empty(
2015-08-03 17:52:20 351
原创 Implement Stack using Queues
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 element.empty() -- Return whet
2015-08-03 17:42:05 431
原创 Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get
2015-08-03 17:23:21 321
原创 Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the
2015-08-03 17:18:39 337
原创 Compare Version Numbers
Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0. You may assume that the version strings are non-empty and co
2015-08-02 15:07:48 329
原创 Roman to Integer
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 思路: 1.了解罗马字符与阿拉伯数字之间的关系; String[] str = new String[] { "M", "CM", "
2015-08-02 14:30:18 303
原创 Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan, a canal: Panama" is a palindrome. "race a car" is not a
2015-08-02 14:03:43 410
原创 Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order, "()" and "()[]{}" are all vali
2015-08-02 13:23:27 302
原创 Reverse Words in a String
Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". Update (2015-02-12): For C programmers: Try to solve it in-place in
2015-08-01 22:09:50 388
原创 Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total nu
2015-08-01 21:45:02 341
原创 Length of Last Word
Length of Last Word Total Accepted: 56328 Total Submissions: 203851My Submissions Question Solution Given a string s consists of upper/lower-case alphabets and empty space charact
2015-08-01 21:09:06 429
jmeter-plugin-dubbo-jar-with-dependencies.jar
2019-12-17
HTTP协议文档
2015-08-02
JSON的jar包
2015-07-31
java网络socket编程过程中遇到的问题
2013-08-01
TA创建的收藏夹 TA关注的收藏夹
TA关注的人