- 博客(15)
- 收藏
- 关注
RSS订阅原创 ArrayList的contains方法与Object的equals方法的关系
ArrayList的contains方法判断两个元素是否为同一元素的标准是该元素（姑且当做Object）的equals方法。下面的例子可以说明问题。public static void main(String[] args) { String str1 = new String("sangyaohui"); String str2 = new String("sangyaohu
2016-04-11 11:17:37
1034
原创 [剑指offer][第四章][28]字符串的排列
[牛客网]字符串测排列题目理解：题目个给的字符串中可能包含重复的字符，你给出的解中也要包含这些重复的字符，但是解集中不应该包含重复的解。import java.util.ArrayList;public class Solution { public ArrayList Permutation(String str) { // 2016-04-11
2016-04-11 11:03:41
236
原创 [剑指offer][第四章][25]Binary Tree Path Sum
[LintCode]Binary Tree Path Sum/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * this.v
2016-04-11 09:57:48
263
原创 [2016.4][京东暑期实习笔试]三子棋
package bupt.syh;import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;public class Main { /** * @param args */ public static void main(String[] args) { Scan
2016-04-08 21:26:11
1042
1
原创 [2016.4][京东暑期实习笔试]生日礼物
package bupt.syh;import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class Main { private static Envelope card; public static void main(String[] args) { Scanner
2016-04-08 21:22:23
614
原创 [剑指offer][第三章][12] Print Numbers by Recursion
[LintCode]Print Numbers by RecursionVersion 1public class Solution { /** * @param n: An integer. * return : An array storing 1 to the largest number with n digits. */ public
2016-04-08 15:04:23
344
原创 [剑指offer][第三章][18]Subtree
[LintCode]Subtree/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * this.val = val; *
2016-04-08 14:17:23
258
原创 [剑指offer][第三章][14]Partition Array by Odd and Even
[LintCode]Partition Array by Odd and Evenpublic class Solution { /** * @param nums: an array of integers * @return: nothing */ public void partitionArray(int[] nums) {
2016-04-08 10:33:58
317
原创 [2016.4][微软笔试]Font Size
题目1 : Font Sizeimport java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int caseNum = in.nextInt(); int
2016-04-07 16:57:00
268
原创 [刷题]Maximum Subarray II
[LintCode]Maximum Subarray IIpublic class Solution { /** * @param nums: A list of integers * @return: An integer denotes the sum of max two non-overlapping subarrays */ public
2016-04-06 09:52:16
415
原创 [hiho]后序遍历
[hiho]后序遍历import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) { String pre = in.nextLine();
2016-04-05 16:01:20
286
原创 [2016腾讯暑期实习在线笔试题][蛇形矩阵]
package bupt.syh;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) { String inputStr = in.nex
2016-04-03 21:58:08
567
1
原创 java中Int与String的相互转化方法
1 String -> int 有两个方法:1). int i = Integer.parseInt(str);2). int i = Integer.valueOf(str).intValue();注: 字串转成 Double, Float, Long 的方法大同小异.2 int -> String 有三种方法:1.) String s = S
2016-04-03 21:21:56
265
原创 [2016腾讯暑期实习在线笔试题]最长回文字符串
import java.util.Scanner;public class Main { // 动态规划 public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) { String input = in.nextLine(); i
2016-04-03 21:08:20
1563
1
转载 HTTP状态码大全
完整的 HTTP 1.1规范说明书来自于RFC 2616，你可以在http://www.talentdigger.cn/home/link.php?url=d3d3LnJmYy1lZGl0b3Iub3JnLw%3D%3D在线查阅。HTTP 1.1的状态码被标记为新特性，因为许多浏览器只支持 HTTP 1.0。你应只把状态码发送给支持 HTTP 1.1的客户端，支持协议版本可以通过调用reque
2016-04-02 21:03:32
251
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人