ass673556617的专栏

DescriptionGiven an expression s includes numbers, letters and brackets. Number represents the number of repetitions inside the brackets(can be a string or another expression)．Please expand expressio...

lint code DescriptionDesign a data structure that supports the following two operations: addWord(word) and search(word)search(word) can search a literal word or a regular expression string con...

Most Stones Removed with Same Row or ColumnOn a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone.Now, a move consists of removing a ston...

959. Regions Cut By Slashes In a N x N grid composed of 1 x 1 squares, each 1 x 1 square consists of a /, \, or blank space.  These characters divide the square into contiguous regions.(Note tha...

1. front end 基本strcuture有了 X2. 还在想怎么构建跟后端的auth3. 不够美观4. 如何跟后端联通,5. mp3音乐要放到哪里6. 其他功能?

1. front end 基本strcuture有了 X2. 还在想怎么构建跟后端的auth3. 不够美观4. 如何跟后端联通,5. mp3音乐要放到哪里6. 其他功能?

1. starter file2. 基本路由 TODO:1. add main page, add theme

1. 刷题2. 做一个小app, 播放本地几首歌包括* angular* material2* nestjs* mongodb 越简单越好* html mp3播放部分

https://leetcode.com/problems/balanced-binary-tree/ 以前应该已经做过这类题了 已经蠢到不忍直视。。 1. 遍历对于左右孩子分别判断是否是平衡的，并且要求左右高度差为<2， 显然在求高度的时候，有些许许多多的重复操作2. 也是遍历，但是避免重复操作 在求高度的时候，可以将是否是平衡树的信息以数字形式re...

 刷题是不太可能的 1. angular 的 observable2. golang的github上的教程,熟悉一下3. 还是想把mit的分布式的课作业做一下  

我目前的记性以及智商，可能不允许看视频学习了，不经常用，看过以后很容易就忘。于是打算开始阅读Unity3D的文档，这样也算是理论知识的一个补充吧。目前也不打算都看，先挑几个比较基础的。打算按照以下的顺序来阅读：1. Scripting2. Phyisics3. Graphics4. Audio5. Animation6. UI7. Multiplayer and networking8. Unit...

https://www.cnblogs.com/CarpenterLee/p/7896361.html

下列"并发技巧清单" 列举了第一部分介绍的概念和规则* 可变状态是直观重要的(it's mutable state, stupid)    所有的并发问题都可以归结为如何协调对并发状态的访问，可变状态越少，就越容易确保线程的安全性。* 尽量将域声明为final类型，除非需要他们是可变的* 不可变对象一定是线程安全的    不可变对象极大地降低并发编程的复杂性，他们更为简单而且安全，可以任意共享而无...

很久没有学习新东西了 近期的计划是1 坚持刷题2 在Umedy上学习unity， 整理到github上3. 看unreal engine的官方文档，入门这两个做游戏的工具4 继续Coursera的AI 系列，之前学习的一点机器学习的内容应该还是有一点帮助5 发现分布式是某些公司比较感兴趣的方面，可以适当的拓展这个领域6 发现总结和表达能力非常重要，表达的好同时也意味着对知识理解的全面。目前来看哪一...

https://blog.csdn.net/wowotuo/article/details/38262057

最近在上umedy上的一门unity入门课，把代码放到了下载区。https://download.csdn.net/download/awawfwfw/10356333知识点涵盖了以下内容：对教程的代码结构不太满意，等有时间的话重新改一下。。。...

https://blog.csdn.net/mazhimazh/article/details/19210547

http://www.cnblogs.com/whatisjava/archive/2013/05/29/3106336.html

推荐一门umedy上的angular课程： Build Angular 5 apps with Firebase and Angular Material点击打开链接内容比较简介, 包括了angular里常用的一些知识点比如 单双向绑定，模板/响应式表格，代码模块化，路由导航(守卫路由)。涵盖了包含login, post, gallery, chat 等功能，样式上使用 angular mater...

http://blog.csdn.net/yangang908/article/details/62215209

http://blog.csdn.net/sallyxyl1993/article/details/69364181

发现Alienware装上ubuntu以后一直不能正常挂起，输入密码以后界面依次关闭，只能重启。。http://www.techbear.co/turning-off-hybrid-graphics-amd-radeon-hd-8700m-debian-jessie-ativ-book-8/解决方法是修改 /etc/default/grub文件里的GRUB_CMDL

http://blog.csdn.net/tragedyxd/article/details/46284949今天配置hadoop遇到一个愚蠢的问题..

有些详细的教程https://ithelp.ithome.com.tw/users/20020617/ironman/1263

http://www.codershood.info/2017/02/09/real-time-private-chatting-app-using-angular-2-nodejs-mongodb-socket-io-part-1/还不错的教程 还在看打算基于这个改进： 1. 单人/多人（eg: room） 聊天 两种模式2. 是否能够提高服务器的性能， node cluster etc

https://alligator.io/angular/angular-material-2/写的比较简介

http://blog.csdn.net/hpu_zyh/article/details/48069159自动填充 用法control + y 再加上, （逗号）  三个键组合，用法跟在vscode里类似

http://blog.sibo.me/golang_tutorials/channels-in-go-range-and-select.html这一篇讲的很详细，不错

Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up t

Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player picks a

Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full binary tre

Print a binary tree in an m*n 2D string array following these rules:The row number m should be equal to the height of the given binary tree.The column number n should always be an odd number.The r

http://blog.csdn.net/liangzuojiayi/article/details/515373141.数组转置和轴对换：数组不仅有transpose方法，还有一个特殊的T属性：arr = np.arange(15).reshape(3,5)[python] view plain copy

You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers.

Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die.Gi

There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. You want to draw a vertical line from the top to the

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note:The given integer is guaranteed to fit within the range

In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.You're given a matrix represented by a two-dim

Solve a given equation and return the value of x in the form of string "x=#value". The equation contains only '+', '-' operation, the variable x and its coefficient.If there is no solution for t

Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.Example 1:Input: [0,1]Output: 2Explanation: [0, 1] is the longest contiguous subarray with e

Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute the

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree

Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.Example 1:Input: 5 / \ 3 6 / \

A zero-indexed array A consisting of N different integers is given. The array contains all integers in the range [0, N - 1].Sets S[K] for 0 S[K] = { A[K], A[A[K]], A[A[A[K]]], ... }.Sets S

In English, we have a concept called root, which can be followed by some other words to form another longer word - let's call this word successor. For example, the root an, followed by other, wh

Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consis

Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.The adding rule is: given a positive in

Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (includi

Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element that appears only once.Example 1:Input: [

Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both numbers

Let's play the minesweeper game (Wikipedia, online game)!You are given a 2D char matrix representing the game board. 'M' represents an unrevealed mine, 'E' represents an unrevealed empty squar

Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of th

Given a binary tree, find the leftmost value in the last row of the tree.Example 1:Input: 2 / \ 1 3Output:1Example 2: Input: 1 / \ 2 3

照着幕课网上的angular4的课的demo项目大概写了一下。对于表单处理比官网上麻烦一些。内容偏基础，继续看教材跟文档。。代码链接： http://download.csdn.net/download/awawfwfw/9951599

英文教材 http 部分的代码下载链接： angular4 http

windows下安装ubuntu可能需要注意secure boot 等问题参考资料：https://www.tecmint.com/install-ubuntu-16-04-alongside-with-windows-10-or-8-in-dual-boot/https://medium.com/@RotekSong/tutorial-how-to-install-u

最近在看RxJS 感觉需要补充一下js的一些特性http://www.ruanyifeng.com/blog/2011/06/designing_ideas_of_inheritance_mechanism_in_javascript.htmlhttp://blog.vjeux.com/2011/javascript/how-prototypal-inheritance

http://scholers.iteye.com/blog/2012936实习的时候，其他组的人有的需要用到策略模式，遂复习一下。 希望有时间看啊。。

类似kickstarter的募捐网站。比较赶的时间做出来。本科作业的水平吧。。使用django框架，用了ckeditor文本编辑插件，material theme框架。https://github.com/liuchang0920/dbproject

照着官网教程写的表单demo。不涉及后端

照着官网写了一下angular的例子。到了HTTP部分比较懵逼。前端东西好多啊。应该在我的资源里能看到代码。

最近找到一个angular 4的官方教材。https://drive.google.com/open?id=0B6iraL1Kt_GLcC1IeHVLd01YRDA

最近做project需要 创建一个富文本框。发现ckeditor是不错的选择。但是配置在django里感觉很蛋疼，github连接上没有给出在前端模板里边怎么表示这个插件。stackoverflow上找到一个简单点的处理方法。首先按照官网的方式在项目里安装ckeditor（我怀疑不需要，声明成CharField就可以，然而已经安装好了就没来得及试）到ckeditor的官网，使用cd

In LLP world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning tim

Given a N X N  matrix Matrix[N][N] of positive integers.  There are only three possible moves from a cell Matrix[r][c].1. Matrix[r+1][c]2. Matrix[r+1][c-1]3. Matrix[r+1][c+1]Starting f

Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of distinct combinations to reach the given score.Input:The first line of input con

Given an interger N, how many structurally unique binary search trees are there that store values 1...N?For example, for N = 2, there are 2 unique BSTs     1               2                   

There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time. Count the number of ways, the person can reach the top (order doe

Given a string, we can "shift" each of its letter to its successive letter, for example: "abc" -> "bcd". We can keep "shifting" which forms the sequence:"abc" -> "bcd" -> ... -> "xyz"Given a l

Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.To make problem a bit easier, all A, B, C, D have same l

Design a Tic-tac-toe game that is played between two players on a n x n grid.You may assume the following rules:A move is guaranteed to be valid and is placed on an empty block.Once a winning

en a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column).If two nodes are in the same row and column, the order should be from left to

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You

Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?这种题不希望再错了。明明很简单的。其实leetcode上面的题说白了就是能不能跟你理解的类型联系起来。如果知道类型了，而且也有思路，写不对，很气的。这道

Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3], [1],

There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certain color is different. You have to paint all the ho

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O

Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "

Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].Credits:好久没做的题，一上来有点小慌，觉得没有印象可能不能一下子写出来。不过还好。看来

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get

Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next()

这一篇补充下leetcode上的二叉树的三种遍历的迭代实现。基本上是参照往上的来的。写的比较清晰 链接：https://segmentfault.com/a/1190000003532763 自己都实现了一遍。这种基础的算法还是要牢固一些。第一题前序遍历：Given a binary tree, return the preorder traversal of its node

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.继续填坑。这道题应该使用空间复杂度O(1)来解。思路是用两个变量分别记录第一行跟第一列时候有0； 因为这个方法需要使用第一行跟第一列记录0行跟列为0的情况，所以会改变这一行，这一列的信息，所以在

According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."Given a board with m 

Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?有一种只需要

Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]基础题。注意下边界条件。i = 0 的时候只有一

Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form.For example:Given s = "aabb", return ["

Design a simplified version of Twitter where users can post tweets, follow/unfollow another user and is able to see the 10 most recent tweets in the user's news feed. Your design should support the fo

A gene string can be represented by an 8-character long string, with choices from "A", "C", "G", "T".Suppose we need to investigate about a mutation (mutation from "start" to "end"), where ONE mut