LeetCode
一生所爱丶
这个作者很懒,什么都没留下…
展开
-
LeetCode: Add Two Numbers
LeetCode: Add Two NumbersYou are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers原创 2016-03-17 13:30:57 · 680 阅读 · 0 评论 -
LeetCode: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 which represents the number 123.Find the total sum of al原创 2016-03-30 12:39:11 · 377 阅读 · 0 评论 -
LeetCode:Move Zeroes
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. For example, given nums = [0, 1, 0, 3, 12], after calling your func原创 2016-03-21 15:40:21 · 625 阅读 · 0 评论 -
LeetCode:SubSets
方法1:借助位运算进行判断public class Solution { public List<List<Integer>> subsets(int[] nums) { List<List<Integer>> result=new ArrayList<List<Integer>>(); int len=nums.length; int dig原创 2016-06-08 16:19:09 · 599 阅读 · 0 评论