程序媛詹妮弗
终身学习
上一页 1 ··· 17 18 19 20 21 22 23 24 25 ··· 30 下一页
摘要: Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may cont 阅读全文
posted @ 2018-10-18 05:18 程序媛詹妮弗 阅读(164) 评论(0) 推荐(0) 编辑
摘要: Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. Example 1: Input: 123Output: "O 阅读全文
posted @ 2018-10-18 04:40 程序媛詹妮弗 阅读(283) 评论(0) 推荐(0) 编辑
摘要: Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? 题意: 给定一个链表,判断是否循环 思路: 快慢指针 若有环,则快慢指针一定会在 阅读全文
posted @ 2018-06-26 06:48 程序媛詹妮弗 阅读(174) 评论(0) 推荐(0) 编辑
摘要: Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the 阅读全文
posted @ 2018-06-26 06:28 程序媛詹妮弗 阅读(93) 评论(0) 推荐(0) 编辑
摘要: Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Example 2: 题意: 有序链表去重 思路: 代码: 阅读全文
posted @ 2018-06-26 06:22 程序媛詹妮弗 阅读(166) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it up 阅读全文
posted @ 2018-06-26 05:55 程序媛詹妮弗 阅读(176) 评论(0) 推荐(0) 编辑
摘要: Reverse a singly linked list. Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? 题意: 如题 思路: 无 代码: 阅读全文
posted @ 2018-06-26 04:39 程序媛詹妮弗 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Bootstrap Introduction Bootstrap 相对于CSS, JS 就像PPT模板相对于PPT 说白了就是前人已经做好了(pre-build)很多模板,你可以直接拿来主义 Bootstarp 4 Two ways to use it 1. download you will se 阅读全文
posted @ 2018-06-22 10:53 程序媛詹妮弗 阅读(251) 评论(0) 推荐(0) 编辑
摘要: Your First CSS(Cascading Style Sheets) Cascading means it always takes selector that is at the end 即后面的可以覆盖前面的。 比如 在以下css文件中定义了两次 <p></p> 的颜色,最终它会呈现gr 阅读全文
posted @ 2018-06-22 03:31 程序媛詹妮弗 阅读(401) 评论(0) 推荐(0) 编辑
摘要: Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Example 2: 题意: 最长回文子串 S 阅读全文
posted @ 2018-06-21 10:28 程序媛詹妮弗 阅读(142) 评论(0) 推荐(0) 编辑
上一页 1 ··· 17 18 19 20 21 22 23 24 25 ··· 30 下一页