- 博客(91)
- 收藏
- 关注
RSS订阅翻译 写日记的好处The Power of Showing Your Work
原文 http://www.gamasutra.com/blogs/MichaelFitch/20140422/216001/The_Power_of_Showing_Your_Work.php
2014-04-26 23:36:06
507
原创 CSDCC经历
第一次来深圳，在飞机上还在看work.py的代码，在飞机上居然能异常专注，可能是做笔记逻辑上理清，不来来回回纠结。 酒店环境真好，能沉下心专注起来。 面试教训：1.技术问题答得模模糊糊，2.毕业论文没说好有点坑，3.关于offer答得不好。4.心态不对，不能静下来。 竞争还是很激烈，牛背景的很多，主要还是心态不对。 --今天看的日本马拉松视频还是比较应
2014-02-22 19:56:24
628
转载 Word Break
public class Solution { public static Set unmatch; public boolean wordBreak(String s, Set dict) { unmatch = new HashSet(); return helper(s,dict); } public boolean helper(
2013-12-01 10:46:07
450
原创 Binary Tree Postorder Traversal
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi
2013-12-01 09:57:06
428
原创 Binary Tree Preorder Traversal
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi
2013-12-01 09:34:00
417
原创 Sort List (大的还没跑通)
public class Solution { public ListNode sortList(ListNode head) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for each
2013-11-24 17:51:37
491
转载 leetcode难度表
zz from : https://docs.google.com/spreadsheet/pub?key=0Aqt--%20wSNYfuxdGxQWVFsOGdVVWxQRlNUVXZTdEpOeEE&output=htmlLeetCode Question Difficulty Distribution : Sheet1
2013-11-22 19:53:16
1020
转载 Octave, gnuplot, and AquaTerm
Today I decided to bring out octave again to work on some Numerical Computing problems. I was encountering an issue I had run into previously, but had worked around a bit. Specifically, the issue
2013-07-03 10:59:17
1287
原创 YD2面
写代码忘了API要问下，不要说忘了这一块。问了LDA，居然理解成逻辑斯蒂回归，还是要看书。快排应该耐心把想法想好先。问公开课回答应该更委婉点。顺着说。计算广告怎么利用他的log预测点击。问问题的时候没有问题 得注意这个。
2013-06-24 22:49:52
480
原创 YD面试
什么 擅长，自己说了概率论，数据结构，算法，离散数学。好吧，等会多问你这个。卷子上这个概率题其实做对了的，当时脑袋不清醒，没说明自己的意思，主要还是概率题突然有点生加上面试有点紧张，不能集中精力。没必要花这么久的，期间还带出抓阄，觉得沟通可能不太好。然后问了排序，这个太久没摸，最基础的东西，各种复杂度，稳定性。冒泡排序最好情况是N的，快排最好是nlgn,希尔排序是n的1.7次方。算
2013-06-14 22:05:24
713
原创 PCFG
1.读入句子，记录 单词个数，非终结点到单词的映射，非终结点到非终结点的映射2.根据得出的统计文件里确认不是RARE的单词 1）替换原文件出现少于5次的单词，匹配patt = '"(\w+)"]'， l = input.readline() words = re.findall(patt,l) for word in words
2013-05-09 17:07:45
967
原创 挫人教训
自己项目介绍太短了，忙了2个月居然就只说了2句话，以后一定要详述。没项目和有项目经验的差别在哪？要做点东西，从用户角度思考问题。还是需要有经验的人，企业项目很短不会有耐心培养人。
2013-05-07 15:50:09
405
原创 Search in Rotated Sorted Array
public class Solution { public int search(int[] A, int target) { // Start typing your Java solution below // DO NOT write main() function int len = A.length; int lo
2013-04-30 19:13:00
429
原创 Search for a Range
public class Solution { public int[] searchRange(int[] A, int target) { // Start typing your Java solution below // DO NOT write main() function boolean isfound = false;
2013-04-30 18:42:17
357
原创 Permutation Sequence
import java.util.HashSet;import java.util.Set;public class Solution { public int count; public String ret; public int num; public String getPermutation(int n, int k) { // St
2013-04-27 00:00:25
454
原创 unique paths II
public class Solution { public static int count; public int uniquePathsWithObstacles(int[][] obstacleGrid) { // Start typing your Java solution below // DO NOT write main() fun
2013-04-26 21:55:24
359
原创 Combinations
public class Solution { public ArrayList> ret; public ArrayList> combine(int n, int k) { // Start typing your Java solution below // DO NOT write main() function ret =
2013-04-23 17:29:45
377
原创 Jump Game II
public class Solution { public int jump(int[] A) { // Start typing your Java solution below // DO NOT write main() function if(A==null)return 0; int len = A.length;
2013-04-23 17:10:44
326
原创 Generate Parentheses
public class Solution { public ArrayList ret; public ArrayList generateParenthesis(int n) { // Start typing your Java solution below // DO NOT write main() function ret
2013-04-23 16:54:08
336
原创 4Sum
public class Solution { public ArrayList> fourSum(int[] num,int target) { // Start typing your Java solution below // DO NOT write main() function if(num==null||num.length>(
2013-04-23 16:07:51
369
原创 Letter Combinations of a Phone Number
import java.util.ArrayList;public class Solution { public int[] count; public char[] letter; ArrayList ret; public ArrayList letterCombinations(String digits) { // Start typi
2013-04-23 15:36:13
496
原创 Pow(x, n)
public class Solution { public double pow(double x, int n) { // Start typing your Java solution below // DO NOT write main() function if(x<0.0001&&n==0)return 1;
2013-04-23 10:24:14
526
原创 Search a 2D Matrix
public class Solution { public boolean searchMatrix(int[][] matrix, int target) { // Start typing your Java solution below // DO NOT write main() function if(matrix==null||
2013-04-23 10:02:29
347
原创 3Sum Closest
import java.util.Arrays;public class Solution { public int min ; public int[] a; public int threeSumClosest(int[] num,int target) { // Start typing your Java solution below
2013-04-22 18:44:48
340
原创 3Sum
public class Solution { public ArrayList> threeSum(int[] num) { // Start typing your Java solution below // DO NOT write main() function if(num==null||num.length>();
2013-04-22 18:04:41
419
原创 Binary Tree Level Order Traversal II
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi
2013-04-22 09:16:59
367
原创 Combination Sum II
public class Solution { public ArrayList> ret; public ArrayList cur; public ArrayList> combinationSum2(int[] candidates, int target) { // Start typing your Java solution below
2013-04-21 23:21:24
597
原创 Combination Sum
public class Solution { public ArrayList l; public ArrayList> l1; public ArrayList> combinationSum(int[] candidates, int target) { // Start typing your Java solution below
2013-04-21 21:59:11
550
原创 Convert Sorted List to Binary Search Tree
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; next = null; } * } *//** * Definition for binary tree
2013-04-21 20:53:25
413
原创 Balanced Binary Tree
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi
2013-04-21 20:03:31
444
原创 Minimum Depth of Binary Tree
public class Solution { public int minDepth(TreeNode root) { // Start typing your Java solution below // DO NOT write main() function if(root==null)return 0; return
2013-04-21 19:27:18
365
原创 Flatten Binary Tree to Linked List
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { priva
2013-04-21 19:06:49
374
原创 Distinct Subsequences
public class Solution { public int numDistinct(String S, String T) { // Start typing your Java solution below // DO NOT write main() function if(S==null||T==null)return 0;
2013-04-21 17:55:11
394
转载 少有人走的路：心智成熟的旅程
《心理学研究》前言部分，解释一般病人寻求心理治疗的原因，他们都面临一个共同的问题-------感觉自己不能够对付或者改变现状，因此产生恐惧，无助感和自我怀疑。大多数病人力不从心的根源，在于他们总想逃避自由，不能够成为他们的问题，他们生活承担责任。他们感到乏力，在于他们放弃了自己的力量。如果得到治疗。他们就会知道，作为成年人，整个一生都充满选择和决定的机会。他们接受这一事实，就会变成自由得人；无法接
2013-04-21 16:36:15
631
原创 Sudoku Solver
public class Solution { private char[][] board; public void solveSudoku(char[][] board) { // Start typing your Java solution below // DO NOT write main() function this.
2013-04-20 18:14:33
340
原创 Binary Tree Maximum Path Sum
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution {
2013-04-20 17:08:11
426
原创 Populating Next Right Pointers in Each Node II
/** * Definition for binary tree with next pointer. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */public class
2013-04-20 15:29:15
478
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人