![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
面试
修远1990
12年浙江大学计算机科学与技术本科毕业;现为浙江大学计算机学院硕士;期间在美国道富公司实习,参与大型金融交易系统和对账系统的开发。此外,还带领一个小型团队开发了一款在线家教系统。
展开
-
面试智力题
[持续更新中,答案选中问题下面的行即可见。。。]1.烧一根不均匀的绳,从头烧到尾总共需要1个小时。现在有若干条材质相同的绳子,问如何用烧绳的方法来计时一个小时十五分钟呢?点燃a绳一端的同时,点燃b绳两段;当b绳烧完时,点燃a绳的另一端;a绳烧完时,点燃c绳两端;c绳烧完时,即经历l一个小时15分钟2.你有一桶果冻,其中有黄色、绿色、红色三种,闭上眼睛抓取同种颜色的两个。抓取多少个就转载 2013-01-30 17:17:54 · 421 阅读 · 0 评论 -
树的遍历
本文对树的遍历操作做个总结:1. 前序遍历递归实现:public class Solution { public List preorderTraversal(TreeNode root){ List result = new ArrayList(); preOrder(result, root); return result; } private void pr原创 2014-09-12 15:26:26 · 361 阅读 · 0 评论 -
[LeetCode]Combinations
LeetCode: https://oj.leetcode.com/problems/combinations/该题采用DFS的方法来解决,和Permutations,N-Queens的解决方式类似:代码如下:public class Solution { public List> combine(int n, int k) { List> comb原创 2014-09-12 19:50:20 · 391 阅读 · 0 评论 -
[LeetCode]Binary Tree Maximum Path Sum
LeetCode: https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/原创 2014-09-12 19:40:15 · 432 阅读 · 0 评论 -
Java笔试面试题
恒生电子笔试题:public class TestCodeSeg{ static { System.out.println("1"); } { System.out.println("2"); } public TestCodeS原创 2013-04-12 11:18:52 · 759 阅读 · 1 评论 -
[LeetCode] Path Sum && Path Sum II
Path Sum: https://oj.leetcode.com/problems/path-sum/Path Sum II: https://oj.leetcode.com/problems/path-sum-ii/原创 2014-09-12 18:54:23 · 491 阅读 · 0 评论 -
[LeetCode] Word Ladder
LeetCode: https://oj.leetcode.com/problems/word-ladder/原创 2014-09-14 15:44:06 · 549 阅读 · 0 评论 -
[LeetCode] Word Search
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 vertically n原创 2014-09-14 16:03:49 · 391 阅读 · 0 评论 -
[LeetCode] Reverse Words in a String
Reverse Words in a StringGiven an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".click to show clarification.Clarification原创 2014-09-14 16:43:23 · 488 阅读 · 0 评论