- 博客(9)
- 收藏
- 关注
RSS订阅原创 an old MIME type Application/x-csv
Today, Focus on Selenium Test to make sure download function works well. Firefox keep pop up a ask dialog to when it is trying to download CSV file, even I set downloading CSV file do not require a
2015-01-14 18:39:12
398
原创 Reverse Integer [Easy]
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Have you thought about this?Here are some good questions to ask before coding. Bonus points for
2014-12-18 14:52:36
307
原创 Add Two Numbers [Medium]
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link
2014-12-17 16:51:28
257
原创 Plus One [Easy]
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.====================
2014-12-17 02:17:53
265
原创 Find Peak Element [Medium]
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in
2014-12-16 18:43:05
568
原创 Reverse Words in a String [Medium]
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".click to show clarification.Clarification:What constitutes
2014-12-16 15:22:15
315
原创 TwoSum[Medium]
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe
2014-12-15 23:29:35
255
原创 Min Stack[Easy]
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
2014-12-15 14:35:10
259
原创 Intersection of Two Linked Lists answer [Easy]
Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘
2014-12-14 22:13:21
278
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人