09 2015 档案
摘要：You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c
阅读全文
摘要：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana...
阅读全文
摘要：Given two sorted integer arraysnums1andnums2, mergenums2intonums1as one sorted array.Note:You may assume thatnums1has enough space (size that is great...
阅读全文
摘要：Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.Do not allocate extra space for a...
阅读全文
摘要：Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 ->...
阅读全文
摘要：Related to questionExcel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A ...
阅读全文
摘要：本题的bonus是因此方法是queue的size 达到了K, 就停止增加元素，保证queue.size() 最大时只有k.Java code:import edu.princeton.cs.algs4.StdIn; import edu.princeton.cs.algs4.StdOut; publ...
阅读全文
摘要：RandomizedQueue 有几个关键点：1. 选择合适的数据结构，因为需要任意位置删除元素，Linked list 做不到，必须使用resizing arrays.2. resizing 的技巧。 Q. How to grow array? A. If array is full, cre...
阅读全文
摘要：本次作业考察利用array 或者linked list 实现规定时间复杂度的queue 和stack， 不能使用java 自带的stack 和queue. 目的是让我们掌握自己设计的函数的复杂度。Deque成功的关键是1. 选择合适的数据结构，本题选择doubly LinkedList.2. 自己写...
阅读全文
摘要：import edu.princeton.cs.algs4.StdOut; import edu.princeton.cs.algs4.StdRandom;import edu.princeton.cs.algs4.StdStats; /* *How do I generate a si...
阅读全文
摘要：3种版本的答案，第一种使用virtual top and bottom site, 但有backwash的问题，解决这个问题有两种方法：1. 使用2个WQUUF, 但会增加memory.One for checking if the system percolates(include virtual...
阅读全文
摘要：Question 1Suppose that you time a program as a function of N and producethe following table. N seconds------------------- 1024 0.000 ...
阅读全文
摘要：Question1Give the id[] array that results from the following sequence of 6 unionoperations on a set of 10 items using the quick-find algorithm. 6-3 2-...
阅读全文
摘要：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb...
阅读全文
摘要：There areNgas stations along a circular route, where the amount of gas at stationiisgas[i].You have a car with an unlimited gas tank and it costscost[...
阅读全文
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
阅读全文
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
阅读全文
摘要：This is afollow upofShortest Word Distance. The only difference is nowword1could be the same asword2.Given a list of words and two wordsword1andword2,...
阅读全文
摘要：This is afollow upofShortest Word Distance. The only difference is now you are given the list of words and your method will be calledrepeatedlymany ti...
阅读全文
摘要：Given a list of words and two wordsword1andword2, return the shortest distance between these two words in the list.For example,Assume that words =["pr...
阅读全文
摘要：Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.For example, givenn...
阅读全文
摘要：Given a string, determine if a permutation of the string could form a palindrome.For example,"code"-> False,"aab"-> True,"carerac"-> True.Hint:Conside...
阅读全文
摘要：Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega...
阅读全文
摘要：Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must close in the correct ...
阅读全文
摘要：Compare two version numbersversion1andversion2.Ifversion1>version2return 1, ifversion1 Integer.parseInt(v2[i])) { return 1; ...
阅读全文
摘要：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 ...
阅读全文
摘要：Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"100".解题思路：直接思路，不需要拐弯。按位加，用flag 记住是否有进位，有是1，没有是0， 用St...
阅读全文
摘要：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...
阅读全文
摘要：Given an array of integers, find out whether there are two distinct indicesiandjin the array such that the difference betweennums[i]andnums[j]is at mo...
阅读全文
摘要：Given an array of integers and an integerk, find out whether there are two distinct indicesiandjin the array such thatnums[i] = nums[j]and the differe...
阅读全文
摘要：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 arr...
阅读全文
该文被密码保护。
摘要：Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->...
阅读全文
摘要：Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to thedefinition of LCA on Wikipedia: “The lowest ...
阅读全文
摘要：Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to thedefinition of LCA on Wikipedia: ...
阅读全文
摘要：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
阅读全文
摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ...
阅读全文
摘要：Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1解题思路：方法一： recursion 交换当前左右节点，并直接调用递归即可方...
阅读全文
摘要：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 an...
阅读全文
摘要：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 le...
阅读全文
摘要：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: a...
阅读全文
摘要：Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-...
阅读全文
摘要：Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, retu...
阅读全文
摘要：Given a linked list, remove thenthnode from the end of list and return its head.For example,Given linked list: 1->2->3->4->5, and n = 2. After removin...
阅读全文
摘要：Write a function to find the longest common prefix string amongst an array of strings.解题思路：先对整个String数组预处理一下，求一个最小长度（最长前缀肯定不能大于最小长度）。然后以第0个字符串作为参照，从第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...
阅读全文
摘要：Remove all elements from a linked list of integers that have valueval.ExampleGiven:1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6,val= 6Return:1 --> 2 --> 3 --...
阅读全文
摘要：Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word doe...
阅读全文
摘要：Implementatoito convert a string to an integer.Hint:Carefully consider all possible input cases. If you want a challenge, please do not see below and ...
阅读全文
摘要：Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't mat...
阅读全文
摘要：Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as theHamming weight).For example, the 32-bit in...
阅读全文
摘要：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 o...
阅读全文
摘要：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()...
阅读全文
摘要：Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (i...
阅读全文
摘要：Given two stringssandt, write a function to determine iftis an anagram ofs.For example,s= "anagram",t= "nagaram", return true.s= "rat",t= "car", retur...
阅读全文
摘要：Find the total area covered by tworectilinearrectangles in a2Dplane.Each rectangle is defined by its bottom left corner and top right corner as shown ...
阅读全文
摘要：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 fo...
阅读全文
摘要：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?根据回文串的特点，我们需要比较对应位置的值是否相等，那么我们首先需要找到...
阅读全文
摘要：Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is1 -> 2 -> 3 -> ...
阅读全文
摘要：Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include2, 3, 5. For examp...
阅读全文
摘要：Given an integer, write a function to determine if it is a power of two.Java code:（两种方法，第二种方法很妙，用到了bit wise ）第二种方法解题思路：如果一个整数是2的幂，那么它的二进制形式最高位为1，其余各位为...
阅读全文
摘要：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...
阅读全文
摘要：Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ...
阅读全文
摘要：Question:Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.简单介绍一下罗马数字，摘自维基百科罗马数字共有7个，即I（1）、V（5...
阅读全文
