一、原题 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 original relative order of the nodes in each

LeetCode   java   单链表   分区  

一、原题   Given a 2D board and a word, find if the word exists in the grid.    The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or ver

LeetCode   java   单词搜索   递归   回溯  

一、原题 Given a sorted linked list, delete all duplicates such that each element appear only once.  For example,  Given 1->1->2, return 1->2.  Given 1->1->2->3->3, return 1->2->3.  一、中文 给定一个单链表,删除重复的元素,相

LeetCode   java   单链表   重复元素  

一、原题 Given a set of distinct integers, nums, return all possible subsets.  Note:  Elements in a subset must be in non-descending order.  The solution set must not contain duplicate subsets.  For examp

java   LeetCode   所有子集  

在eclipse好用,在Android上移植使用还是挺麻烦的,gradle会因为版本的问题各种报错,由于是初学者所以比较头疼,好在有下面的方法,可以省去很多gradle配置的环节。 注意:本教程针对像SlidingMenu这样使用Eclipse结构的第三方库。过程简单,容易,方便记忆(实际上就三步),为防止出现意外,进行了多次测试,全部通过。多图预警,开始: 第一步,去GitHub下载Slidin

Android studio   Sliding Menu   java   第三方库  

一、原题 Given two binary strings, return their sum (also a binary string).  For example,  a = "11"  b = "1"  Return "100"  一、中文 给定两个二进制的字符串,返回它们的和,也是二进行制字符串。  三、举例 str1 = “111”,str2=“1”最后返回的结果的是1000 四、思路

java   LeetCode  

一、原题 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.  Note: You can only move either down or right

java   LeetCode   logN  

一、原题 A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).  The robot can only move either down or right at any point in time. The robot is trying to reach t

java   LeetCode  

一、基本操作 如下是一些git的基本操作,主要包括是分支,复制,添加,提交,连接 新建a分支 git branch a  切换到a分支之下 git checkout a  这个命令的意思就是新建一个a分支,并且自动切换到a分支。 git checkout -b a  将feature分支合并到当前分支 git merge feature git log 查看日志 git add a.md git

java  

一、原题 Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).  You may assume that the intervals were initially sorted according to their start times. 

java   LeetCode  
1 2 3 4 5