随笔分类 - CareerCup
摘要：18.13 Given a list of millions of words, design an algorithm to create the largest possible rectangle of letters such that every row forms a word (rea
阅读全文
摘要：18.12 Given an NxN matrix of positive and negative integers, write code to find the submatrix with the largest possible sum. 这道求和最大的子矩阵，跟LeetCode上的Max
阅读全文
摘要：18.11 Imagine you have a square matrix, where each cell (pixel) is either black or white. Design an algorithm to find the maximum subsquare such that
阅读全文
摘要：18.10 Given two words of equal length that are in a dictionary, write a method to transform one word into another word by changing only one letter at
阅读全文
摘要：18.9 Numbers are randomly generated and passed to a method. Write a program to find and maintain the median value as new values are generated. LeetCod
阅读全文
摘要：18.8 Given a string s and an array of smaller strings T, design a method to search s for each small string in T. 这道题给我们一个字符串s，和一个字符串数组T，让我们找T中的每一个小字符串
阅读全文
摘要：5.7 Given a list of words, write a program to find the longest word made of other words in the list. 这道题给了我们一个字符串数组，让我们找到最长的那个单词是由字符串数组中的其他单词组成的，LeetC
阅读全文
摘要：18.6 Describe an algorithm to find the smallest one million numbers in one billion numbers. Assume that the computer memory can hold all one billion n
阅读全文
摘要：18.5 You have a large text file containing words. Given any two words, find the shortest distance (in terms of number of words) between them in the fi
阅读全文
摘要：18.4 Write a method to count the number of 2s between 0 and n. 这道题给了我们一个整数n，让我们求[0,n]区间内所有2出现的个数，比如如果n=20，那么满足题意的是2, 12, 20,那么返回3即可。LeetCode上有一道很类似的题F
阅读全文
摘要：18.3 Write a method to randomly generate a set of m integers from an array of size n. Each element must have equal probability of being chosen. 这道题让我们
阅读全文
摘要：18.2 Write a method to shuffle a deck of cards. It must be a perfect shuffle—in other words, each of the 52! permutations of the deck has to be equall
阅读全文
摘要：18.1 Write a function that adds two numbers. You should not use + or any arithmetic operators. 这道题让我们实现两数相加，但是不能用加号或者其他什么数学运算符号，那么我们只能回归计算机运算的本质，位操作Bi
阅读全文
摘要：17.14 Oh, no! You have just completed a lengthy document when you have an unfortunate Find/Replace mishap. You have accidentally removed all spaces, p
阅读全文
摘要：17.13 Consider a simple node-like data structure called BiNode, which has pointers to two other nodes. The data structure BiNode could be used to repr
阅读全文
摘要：17.12 Design an algorithm to find all pairs of integers within an array which sum to a specified value. 这道题实际上跟LeetCode上的Two Sum很类似，但是不同的是，那道题限定了只有一组解
阅读全文
摘要：17.11 Implement a method rand7() given rand5(). That is, given a method that generates a random number between 0 and 4 (inclusive), write a method tha
阅读全文
摘要：17.10 Since XML is very verbose, you are given a way of encoding it where each tag gets mapped to a pre-defined integer value. The language/grammar is
阅读全文
摘要：17.9 Design a method to find the frequency of occurrences of any given word in a book. 这道题让我们找书中单词出现的频率，那么首先需要搞清楚的问题是，只需要统计一个单词，还是多个单词。如果是一个单词的话，那直接就遍
阅读全文
摘要：17.8 You are given an array of integers (both positive and negative). Find the contiguous sequence with the largest sum. Return the sum. LeetCode上的原题，
阅读全文
