leetcode
xiayu98020214
这个作者很懒,什么都没留下…
展开
-
leecode 6
public static String convert(String s, int nRows) { StringBuffer newstring = new StringBuffer(); if((nRows == 1) || (s.length() for(int i = 0 ; i newstring.append(s.cha原创 2015-04-23 14:43:13 · 462 阅读 · 0 评论 -
leecode Remove Nth Node From End of List
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { pub原创 2015-05-31 18:15:23 · 394 阅读 · 0 评论 -
leecode Generate Parentheses
public static List generateParenthesis(int n) { List l = new ArrayList(); addParenthesis(l,"",n,0); return l; } public static void addParenthesis(List l, String s,原创 2015-05-31 20:59:12 · 468 阅读 · 0 评论 -
leecode Swap Nodes in Pairs
1. 自己的解法 public class Solution { public ListNode swapPairs(ListNode head) { if(head == null || head.next == null) return head; ListNode newhead = head.next ; ListNode curr原创 2015-05-27 13:52:35 · 423 阅读 · 0 评论 -
leecode 10 Regular Expression Matching
package com.xiayu.maching; public class main { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub boolean r原创 2015-04-27 18:01:00 · 418 阅读 · 0 评论 -
50 Pow(x, n)
public class Solution { public double myPow(double x, int n) { if(x == 1){ return 1; }else if(x == -1){ if(n%2 == 0) return原创 2015-05-04 23:40:45 · 843 阅读 · 1 评论 -
46 Permutations
public List> permute(int[] num) { LinkedList> res = new LinkedList>(); res.add(new ArrayList()); for (int n : num) { int size = res.size(); for (; size > 0; size--) {原创 2015-05-08 18:23:37 · 984 阅读 · 0 评论 -
leecode 2
package xiayu; public class add { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub ListNode l1 = new ListNode(0);原创 2015-04-17 17:17:35 · 510 阅读 · 0 评论 -
leecode 1
package sum; import java.util.ArrayList; class sumall { private ArrayList mNumber1 = new ArrayList(); //和target符号相同,但是比target更接近零 private ArrayList mNumber2 = new ArrayList();//和target符号相同,比tar原创 2015-04-17 00:45:59 · 474 阅读 · 0 评论 -
leecode 3
public class Solution { public int lengthOfLongestSubstring(String s) { if (s == null || s.length() == 0) { return 0; } HashSet set = new HashSet原创 2015-04-20 17:53:23 · 676 阅读 · 0 评论 -
leecode 7 Reverse Integer
public class Solution { public static int reverse(int x) { int x_cp; if(x x_cp = -x; }else{ x_cp = x; } long result = 0; while(x_cp !=0原创 2015-04-23 15:44:03 · 467 阅读 · 0 评论 -
全排列递归算法
递归一定要画树形图: 什么是递归,就是深度优先吧,直接插到最底部,再慢慢出栈。 package com.xiayu.string; import java.util.ArrayList; import java.util.List; public class find { public原创 2015-06-01 00:42:21 · 443 阅读 · 0 评论