自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(12)
  • 收藏
  • 关注

转载 Lintcode136 Palindrome Partitioning solution 题解

【题目描述】 Given a strings, partitionssuch that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. 给定一个字符串s,将s分割成一些子串,使每个子串都是回文串。 【题目链接】 www.lintc

2017-09-30 15:14:23 232

转载 Lintcode135 Combination Sum solution 题解

【题目描述】 Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C unlimi

2017-09-29 14:36:52 255

转载 Lintcode134 Lru Cache solution 题解

【题目描述】 Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset. get(key)- Get the value (will always be positive) of the k

2017-09-28 11:49:32 355

转载 GOOGLE ON-CAMPUS 面试经验

网申3个星期后,收到了电面邀请。电面通过后,一共进行了两轮 on-compus 面试。 电面一共两个问题,面了大概1个小时,平均每道题30分钟左右。题目不是很难。 On-campous 一共两轮。每轮45分钟左右,面试内容包括自我介绍、一些项目相关问题和几个很简单的基础问题。但主要还是在考察编程能力。面试过程中被问到以下算法题: 第一轮: 1、LintCode 简单题:2-su

2017-09-27 13:40:06 458

转载 Lintcode133 Longest Words solution 题解

【题目描述】 Given a dictionary, find all of the longest words in the dictionary. 给一个词典,找出其中所有最长的单词。 【题目链接】 www.lintcode.com/en/problem/longest-words/ 【题目解析】 容易想到的是首先遍历一次,找到最长的字符串。第二次遍历时取最长的放到最终

2017-09-27 13:35:10 312

转载 Lintcode132 Word Search || solution 题解

【题目描述】 Given a matrix of lower alphabetsand a dictionary.Find all words in the dictionary that can be found in the matrix. A word can start from any position in the matrix and go left/right/up/do

2017-09-26 13:01:27 261

转载 Lintcode131 Building Outline solution 题解

【题目描述】 GivenNbuildings in a x-axis,each building is a rectangle and can be represented by a triple (start, end, height),where start is the start position on x-axis, end is the end position on x-a

2017-09-24 19:22:03 350

转载 Lintcode130 Heapify solution 题解

【题目描述】 Given an integer array, heapify it into a min-heap array. For a heap array A, A[0] is the root of heap, and for each A[i], A[i * 2 + 1] is the left child of A[i] and A[i * 2 + 2] is the r

2017-09-23 21:35:08 357

转载 Lintcode129 Rehashing solution 题解

【题目描述】 The size of the hash table is not determinate at the very beginning. If the total size of keys is too large (e.g. size >= capacity / 10), we should double the size of the hash table and re

2017-09-22 15:43:36 357

转载 Lintcode128 Hash Function solution 题解

【题目描述】 In data structure Hash, hash function is used to convert a string(or any other type) into an integer smaller than hash size and bigger or equal to zero. The objective of designing a hash f

2017-09-21 12:36:16 364

转载 Lintcode127 Topological Sorting solution 题解

【题目描述】 Given an directed graph, a topological order of the graph nodes is defined as follow: ·For each directed edgeA -> Bin graph, A must before B in the order list. ·The first node in the ord

2017-09-20 15:41:00 280

转载 GOOGLE SDE 电面面经

简单分享一下Google电面的面试经验。电面一共有两轮。其实算法题目出得都不太难,可惜自己当时基础不过关,在第二轮电面就败下阵来。 电面1 一面互相简单自我介绍之后就直接开始做题。 题目1:给出一组整数,计算有多少两个数组成的对(要求对不重复)大于一个特定的值 LintCode原题: http://www.lintcode.com/zh-cn/problem/two-sum-g

2017-09-19 08:20:58 1023

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除