California_dream-CSDN博客

转载 Lintcode125 Backpack ||solution 题解

【题目描述】Givennitems with size Aiand value Vi, and a backpack with sizem. What's the maximum value can you put into the backpack?给出n个物品的体积A[i]和其价值V[i]，将他们装入一个大小为m的背包，最多能装入的总价值有多大？【注】：A[i], V[i]

2017-09-19 21:24:20 361

转载 Lintcode124 Longest Consecutive Sequence solution 题解

【题目描述】Given an unsorted array of integers, find the length of the longest consecutive elements sequence.给定一个未排序的整数数组，找出最长连续序列的长度。【题目链接】www.lintcode.com/en/problem/longest-consecutive-sequenc

2017-09-17 23:49:13 228

转载 Lintcode123 Word Search solution 题解

【题目描述】Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or ve

2017-09-15 23:00:35 237

转载 Lintcode122 Largest Rectangle In Histogram solution 题解

【题目描述】Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where

2017-09-14 11:57:05 228

转载 Google New Grad 两轮电面经历分享

两周前在网上看到谷歌软件工程师的招聘信息，然后投了简历。到现在已经进行了两轮电面。虽然这目前进行了的两轮电面表现没达到自己预期，但所幸通过，目前在等待进一步的面试通知。严格来说，这次面试是我经历的第一次正式面试，所以电面一面时较紧张，加之面试官的性子不是很活络，我在面试过程中也略沉默，所以感觉一面表现的非常不理想。二面的面试官比较nice，在面试过程中也有进行适当提点，加上一面的经验，二面

2017-09-14 00:11:30 1737

转载 Lintcode121 Word Ladder || solution 题解

【题目描述】Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:1.Only one letter can be changed at a time2.Each intermediate word

2017-09-14 00:10:09 344

转载 Lintcode120 Word Ladder solution 题解

【题目描述】Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:1.Only one letter can be changed at a time2.Each intermedia

2017-09-12 23:44:07 219

转载 Lintcode119 Edit Distance solution 题解

【题目描述】Given two wordsword1andword2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a

2017-09-11 00:01:30 255

转载 Lintcode118 Distinct Subsequences solution 题解

【题目描述】Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the original string by deleting some (can be n

2017-09-10 23:57:45 289

转载 Lintcode117 Jump Game || solution 题解

【题目描述】Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your

2017-09-09 22:34:36 207

转载 Lintcode116 Jump Game solution 题解

【题目描述】Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Deter

2017-09-07 00:07:23 309

California_dream的博客