![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode算法
njuptsxd
这个作者很懒,什么都没留下…
展开
-
LeetCode: TWO SUM
//思路,使用 public class Solution { public int[] twoSum(int[] numbers, int target) { int[] source = new int[numbers.length]; for (int i = 0; i < numbers.length; i++) { source[i] = numbe转载 2014-05-06 22:20:46 · 369 阅读 · 0 评论 -
leetcode: Word Search
import java.util.Arrays; import java.util.Scanner; public class WordSearch { boolean result; /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub转载 2014-05-21 17:02:24 · 571 阅读 · 0 评论 -
Leetcode:Generate Parentheses
import java.util.ArrayList; import java.util.Arrays; import java.util.Scanner; public class GenerateParentheses { /** * @param args */ public static void main(String[] args) { // TODO Auto-g转载 2014-05-21 09:55:04 · 458 阅读 · 0 评论 -
Leetcode : EditDistance(编程之美3.3)
假如我们要将字符串str1变成str2 sstr1(i)是str1的子串,范围[0到i),sstr1(0)是空串 sstr2(j)是str2的子串,同上 d(i,j)表示将sstr1(i)变成sstr2(j)的编辑距离 首先d(0,t),0 当我们要计算d(i,j)时,即计算sstr1(i)到sstr2(j)之间的编辑距离, 此时,设sstr1(i)形式是somestr1c转载 2014-05-16 11:12:32 · 391 阅读 · 0 评论 -
leetcode : Unique Paths
解法一: 利用递归进行求解 , s[m][n]转载 2014-05-15 15:41:43 · 346 阅读 · 0 评论 -
Leetcode: Decode ways
public int numDecodings(String s) { if (s == null || s.length() == 0) { return 0; } int[] temp = new int[s.length()]; for(int i=0;i<s.length();i++){ temp[i]=0; } if (check(s.ch转载 2014-05-17 00:03:47 · 357 阅读 · 0 评论 -
求和问题总结(leetcode 2Sum, 3Sum, 4Sum, K Sum)
求和问题总结(leetcode 2Sum, 3Sum, 4Sum, K Sum) 分类: leetcode2013-10-09 20:51 450人阅读 评论(0) 收藏 举报 leetcode 目录(?)[+] 转载自: http://tech-wonderland.net/blog/summary-of-ksum-problems.html转载 2014-05-08 21:11:31 · 351 阅读 · 0 评论 -
LeetCode: String to Int
import java.util.Scanner; public class StringToInt { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in);转载 2014-05-07 22:20:40 · 378 阅读 · 0 评论 -
LeetCode : Unique Binary Search Tree
import java.util.Scanner; public class UniqueBinarySearchTree { int count = 0; /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner sca原创 2014-04-04 16:18:12 · 384 阅读 · 0 评论 -
leetcode:Word Ladder
题目 Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a timeEach intermediate转载 2014-05-23 15:06:24 · 523 阅读 · 0 评论