小白兔云

2019年4月17日

摘要： Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note: Your al 阅读全文

posted @ 2019-04-17 21:28 小白兔云阅读(107) 评论(0) 推荐(0) 编辑

leetcode [134]Gas Station

摘要： There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it cost 阅读全文

posted @ 2019-04-17 20:43 小白兔云阅读(110) 评论(0) 推荐(0) 编辑

leetcode [133]Clone Graph

摘要： Given a reference of a node in a connected undirected graph, return a deep copy(clone) of the graph. Each node in the graph contains a val (int) and a 阅读全文

posted @ 2019-04-17 11:33 小白兔云阅读(171) 评论(0) 推荐(0) 编辑

2019年4月16日

leetcode [131]Palindrome Partitioning

摘要： Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example: 题阅读全文

posted @ 2019-04-16 11:42 小白兔云阅读(82) 评论(0) 推荐(0) 编辑

leetcode [130]Surrounded Regions

摘要： Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in 阅读全文

posted @ 2019-04-16 11:20 小白兔云阅读(139) 评论(0) 推荐(0) 编辑

leetcode [129]Sum Root to Leaf Numbers

摘要： Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文

posted @ 2019-04-16 10:42 小白兔云阅读(192) 评论(0) 推荐(0) 编辑

2019年4月15日

Java创建线程的三种方式

摘要： 1.继承Thread,并重写run()方法，重写run方法，该方法是线程执行体 2.通过Runable去创建线程，也是重写run方法，该方法是线程执行体执行结果部分结果：可以看出线程1和线程2共享了MyRunnable实例对象的i。 3.通过Callable和Future创建线程，通过继承Thr 阅读全文

posted @ 2019-04-15 17:11 小白兔云阅读(237) 评论(0) 推荐(0) 编辑

leetcode [120]Triangle

摘要： 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 fo 阅读全文

posted @ 2019-04-15 15:44 小白兔云阅读(172) 评论(0) 推荐(0) 编辑

leetcode [117]Populating Next Right Pointers in Each Node II

摘要： Given a binary tree Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL 阅读全文

posted @ 2019-04-15 11:16 小白兔云阅读(121) 评论(0) 推荐(0) 编辑

2019年4月14日

leetcode [114]Flatten Binary Tree to Linked List

摘要： Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look 阅读全文

posted @ 2019-04-14 16:38 小白兔云阅读(219) 评论(0) 推荐(0) 编辑

公告