- 博客(25)
- 收藏
- 关注
RSS订阅原创 test
Investor RelationsFlagstar Bancorp, Inc., is the largest publicly held savings bank headquartered in the Midwest. Its stock is traded on the New York Stock Exchange under the symbol FBC. F
2014-03-19 02:31:03
2315
原创 23
try {DocumentBuilderFactory domFactory = DocumentBuilderFactory.newInstance();domFactory.setNamespaceAware(true);// never forget this!DocumentBuilder builder = domFactory.newDocumentBuil
2014-02-28 14:58:49
367
原创 yuanchuang
try { DocumentBuilderFactory domFactory = DocumentBuilderFactory.newInstance(); domFactory.setNamespaceAware(true); // never forget this! DocumentBuilder builder = domFactory.newDocumentBuilder()
2014-02-28 14:56:25
337
原创 6
try { DocumentBuilderFactory dbFactory = DocumentBuilderFactory.newInstance(); DocumentBuilder dBuilder = dbFactory.newDocumentBuilder(); Document doc = dBuilder.parse(new URL("http://api.flickr
2014-02-28 14:12:45
382
原创 6
try {DocumentBuilderFactory dbFactory =DocumentBuilderFactory.newInstance();DocumentBuilder dBuilder = dbFactory.newDocumentBuilder();Document doc = dBuilder.parse(new URL("http://api.flickr.c
2014-02-28 14:12:16
361
原创 5
Thumbnail Sample .thumb { width: 100px; height: 100px; } .thumb:active { width: 100%; height: 100%; } Thumbnail Sample
2014-02-28 14:02:31
338
原创 3
Thumbnail Sample.thumb { width: 100px; height: 100px;}.thumb:active { width: 100%; height: 100%;} Thumbnail Sample <img class="thumb" src="http://images.c-spanvideo.or
2014-02-28 14:00:38
331
原创 2
public static BufferedImage getImageByUrl(String url) { try { URL iurl = new URL(url); BufferedImage ret = ImageIO.read(iurl); return ret; } catch (Exception e) { e.printStackTrace();
2014-02-28 13:55:46
347
原创 3
public class Solution { public String longestPalindrome(String s) { if (s == null || s.length() < 2) return s; String tmp = ""; String resultString = ""; for (int i = 0; i < s.length();
2014-02-10 23:09:21
322
原创 4
int lengthOfLongestSubstring(String s) { if (s == null || s.length() == 0) return 0; HashMap hs = new HashMap(); int result = 0; int curResult = 0; for (int i = 0; i < s.length(); i++) {
2014-02-10 13:28:13
364
原创 4
int lengthOfLongestSubstring(String s) { if (s == null || s.length() == 0) return 0; HashMap hs = new HashMap(); int result = 0; String tmpRst = ""; for (int i = 0; i < s.length(); i++) {
2014-02-10 13:25:14
369
原创 1
public class Solution { public ArrayList inorderTraversal(TreeNode root) { ArrayList result = new ArrayList(); Stack st = new Stack(); while (root != null || !st.isEmpty()) { if (root == n
2014-01-25 12:06:58
445
原创 4
public ArrayList restoreIpAddresses(String s) { ArrayList r = new ArrayList(); restoreHelper(0, s.length(), s, new ArrayList(), r); return r; } public void restoreHelper(int curSum, int n
2014-01-23 03:07:40
358
原创 3
public void nQueen(int n, int cur, ArrayList result, boolean []x, boolean []left, boolean []right,char [][]record){ if(cur == n){ String[] tmp_res = new String[n]; for(int i=0;i<n;i++
2014-01-21 10:43:25
336
原创 2
public class Solution { public boolean exist(char[][] board, String word) { if (board == null) return false; boolean[][] visited = new boolean[board.length][board[0].length]; for (int i = 0
2014-01-18 12:47:12
355
原创 3
while (ptr2 != null && ptr2.next!=null) { //System.out.print(ptr1.val+", "+ptr2.val+"\n"); if(ptr1 == ptr2) return true; ptr1 = ptr1.next; ptr2 = ptr2.next.next; }
2014-01-17 12:02:48
284
原创 5
public String multiply(String num1, String num2) { if(num1.length() == 0 || num2.length() == 0) { return (new String()); } if(num1.equalsIgnoreCase("0") || num2.equalsIgnoreCase("0")) {
2014-01-16 23:30:26
305
原创 3
private enum Type { Space(0), Sign(1), Digit(2), Dot(3), Exp(4), Null(-1); private int type; private Type(int t) { type = t; } public int getType() { return type; } } pub
2014-01-15 23:35:07
337
原创 3
while(ptr != null) { if(pre.val == ptr.val) { pre.next = ptr.next; } else { pre = ptr; // Not check 111 case Only move pre when no duplicates } ptr = ptr.next; }
2014-01-15 22:26:02
323
原创 2
public ArrayList> combine(int n, int k) { ArrayList> resSet = new ArrayList>(); if (k == 1) { for (int i=1; i<=n; ++i) { ArrayList res = new ArrayList(); res.add(i);
2014-01-15 09:36:43
323
原创 1
public ArrayList> combine(int n, int k) { ArrayList> resSet = new ArrayList>(); if (k == 1) { for (int i=1; i<=n; ++i) { ArrayList res = new ArrayList(); res.add(i);
2014-01-15 09:34:53
291
原创 1
double np=x; double res=1; while (n>0){ if (n%2==1){ res = res * np; } np=np*np; n=n/2; } double result = 1
2014-01-14 23:29:50
351
原创 1
public ArrayList anagrams(String[] strs) { // Start typing your Java solution below // DO NOT write main() function ArrayList res = new ArrayList(); int n = strs.length
2014-01-14 16:27:32
296
原创 cs
public ArrayList> combinationSum(int[] candidates, int target) { ArrayList> result = new ArrayList>(); if(candidates == null || candidates.length == 0) return result; Arrays.sort(candidates);
2014-01-14 14:22:38
529
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人