摘要：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 @ 2016-09-21 01:47
09 2016 档案
摘要：Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: Note: You may assume the
阅读全文
posted @ 2016-09-21 01:35
摘要：Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the rans
阅读全文
posted @ 2016-09-21 01:14
摘要：We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wron
阅读全文
posted @ 2016-09-21 00:58
摘要：Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example:Given a = 1 and b = 2, return 3. 题目要求：计算两个整型的和
阅读全文
posted @ 2016-09-20 23:35
摘要：Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. Note: Each elemen
阅读全文
posted @ 2016-09-20 23:02
摘要：Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element i
阅读全文
posted @ 2016-09-20 22:56
摘要：Write a function that takes a string as input and reverse only the vowels of a string. Example 1:Given s = "hello", return "holle". Example 2:Given s
阅读全文
posted @ 2016-09-20 22:39
摘要：Write a function that takes a string as input and returns the string reversed. Example:Given s = "hello", return "olleh". 把前后相应的位置调换就行了
阅读全文
posted @ 2016-09-20 21:58
摘要：Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example:Given num = 16, return true. Given num = 5, return fa
阅读全文
posted @ 2016-09-20 21:50
摘要：The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font
阅读全文
posted @ 2016-09-20 21:15
摘要：Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here a
阅读全文
posted @ 2016-09-20 19:55
摘要：Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below
阅读全文
posted @ 2016-09-20 19:28
摘要：这个题目我也没有思路，同学们可以查看这个http://www.cnblogs.com/NickyYe/p/4442867.html 下面是我改进后的代码 第一种方法： 第二种方法：
阅读全文
posted @ 2016-09-19 23:50
摘要：Determine whether an integer is a palindrome. Do this without extra space. 判断一个数是否是回文数，不能用额外的空间 我第一次做的时候，没有考虑到不能用额外的空间(空间复杂度为（n）），用了一个字符串来保存数字，而且题目的设定
阅读全文
posted @ 2016-09-19 17:33
摘要：Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 罗马数字：可以查看维基百科的定义 . 最大为MMMCMXCIX,我们需要注意的是9的
阅读全文
posted @ 2016-09-19 16:27
摘要：Write a function to find the longest common prefix string amongst an array of strings. 让我们在一个字符串中找出所有字符串的共同前缀
阅读全文
posted @ 2016-09-18 23:39
摘要：Given a linked list, remove the nth node from the end of list and return its head. For example, Note:Given n will always be valid.Try to do this in on
阅读全文
posted @ 2016-09-18 23:18
摘要：Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the
阅读全文
posted @ 2016-09-18 17:18
摘要：Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 没什么好说的，把
阅读全文
posted @ 2016-09-18 16:52
摘要：Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your a
阅读全文
posted @ 2016-09-18 16:39
摘要：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space fo
阅读全文
posted @ 2016-09-18 16:10
摘要：Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 这个题目就是在一个字符串中找到另外一个字符串第一
阅读全文
posted @ 2016-09-17 17:06
摘要：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ... 1 is read off as "one 1" or 11.11 is read off
阅读全文
posted @ 2016-09-17 16:50
摘要：Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where empty cells are filled wit
阅读全文
posted @ 2016-09-17 16:45
摘要：Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word
阅读全文
posted @ 2016-09-16 23:07
摘要：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 a
阅读全文
posted @ 2016-09-16 22:58
摘要：Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100". 这个题目只要注意各种情况你就成功了一大半，特别要注意的是对进位赋值后可能产生的变化，
阅读全文
posted @ 2016-09-16 22:43
摘要：You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl
阅读全文
posted @ 2016-09-16 21:41
摘要：Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3,
阅读全文
posted @ 2016-09-16 21:32
摘要：Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size tha
阅读全文
posted @ 2016-09-16 21:19
摘要：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 a
阅读全文
posted @ 2016-09-16 20:14
摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet
阅读全文
posted @ 2016-09-16 20:08
摘要：这次笔试是今年校招我参加的第一次笔试。。出了很多状况，基础知识不扎实，导致选择题耽误了太多时间，导致后面的题目没做完，编程题也没有在 时间内写出来，基本没有面试机会了。不过我继续研究第二个编程题，在10几分钟后做了出来。 这个题目具体已经不记得了，但是大概意思还是记得，我们把由4和7组成的数，按小大
阅读全文
posted @ 2016-09-05 22:37
摘要：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 l
阅读全文
posted @ 2016-09-05 17:07
摘要：Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For
阅读全文
posted @ 2016-09-05 16:52
摘要：Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept
阅读全文
posted @ 2016-09-05 14:55
摘要：Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l
阅读全文
posted @ 2016-09-05 14:15
浙公网安备 33010602011771号