摘要: Convolutional Neural Networks https://www.coursera.org/learn/convolutional-neural-networks/home/welcome There are still something confuse me! working 阅读全文
posted @ 2018-05-02 12:02 wz30 阅读(254) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/water-and-jug-problem/description/ -- 365 There are two methods to solve this problem : GCD(+ elementary number theory) 阅读全文
posted @ 2018-05-02 11:52 wz30 阅读(187) 评论(0) 推荐(0) 编辑
摘要: solution discussion https://leetcode.com/problems/kth-largest-element-in-an-array/description/ -- 215 problems https://leetcode.com/problems/kth-large 阅读全文
posted @ 2018-05-02 10:40 wz30 阅读(172) 评论(0) 推荐(0) 编辑
摘要: This week, I focused more on the final project, such as H335(Computer structure, still confused with the stack frame and recursion) and B365(plan to t 阅读全文
posted @ 2018-04-27 12:23 wz30 阅读(139) 评论(0) 推荐(0) 编辑
摘要: 1. I only solved two problems 阅读全文
posted @ 2018-04-22 09:29 wz30 阅读(111) 评论(0) 推荐(0) 编辑
摘要: Leetcode: 11 there are two ways to deal with two pointers one is O(n), two pointers moves from both side Another is O(2N), two pointer move from the s 阅读全文
posted @ 2018-04-22 09:28 wz30 阅读(80) 评论(0) 推荐(0) 编辑
摘要: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_5_A The Maximum Number of Customers Idea: find the most overlapped segment. Similiar to t 阅读全文
posted @ 2018-04-19 23:08 wz30 阅读(173) 评论(0) 推荐(0) 编辑
摘要: 1. English -- translation(ted,tv show),listening 2. Computer Science 3. Swimming -- GYM 阅读全文
posted @ 2018-04-18 13:13 wz30 阅读(97) 评论(0) 推荐(0) 编辑
摘要: Plan: Homework: B365 (next week) B392, B335 Interview: Friday, do the assignment Thursday Summary: It's been two weeks to write the blog again! It is 阅读全文
posted @ 2018-04-18 13:05 wz30 阅读(101) 评论(0) 推荐(0) 编辑
摘要: Problem: installing the xgboost to get the python package for later importing 阅读全文
posted @ 2018-04-16 09:31 wz30 阅读(247) 评论(0) 推荐(0) 编辑