程序媛詹妮弗
终身学习
摘要: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文
posted @ 2018-05-19 10:00 程序媛詹妮弗 阅读(261) 评论(0) 推荐(0) 编辑
摘要: The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 阅读全文
posted @ 2018-05-19 08:06 程序媛詹妮弗 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2018-05-19 07:36 程序媛詹妮弗 阅读(138) 评论(0) 推荐(0) 编辑
摘要: Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*'. The matching should cover the entire in 阅读全文
posted @ 2018-05-19 07:19 程序媛詹妮弗 阅读(185) 评论(0) 推荐(0) 编辑
摘要: Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'. The matching should cover the entire  阅读全文
posted @ 2018-05-19 06:46 程序媛詹妮弗 阅读(193) 评论(0) 推荐(0) 编辑
该文被密码保护。 阅读全文
posted @ 2018-05-19 05:49 程序媛詹妮弗 阅读(2) 评论(0) 推荐(0) 编辑
摘要: Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. Input: [0,1,0,3, 阅读全文
posted @ 2018-05-19 03:20 程序媛詹妮弗 阅读(107) 评论(0) 推荐(0) 编辑