![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 81
chicc999
这个作者很懒,什么都没留下…
展开
-
算法 Robert Sedgewick 习题答案 1.1 基础编程模型
1.1.17200.0000002true1.1.2 double 1.618double 10.0boolaen trueString 331.1.3package chapter1_1;public class Exercise3 { public static void main(String[] args) { if (原创 2013-11-18 16:26:10 · 1335 阅读 · 0 评论 -
【LeetCode】Linked List Cycle
判断是否是循环链表只需要用快慢指针,kanshifou原创 2014-08-13 21:24:56 · 372 阅读 · 0 评论 -
【LeetCode】Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \原创 2014-08-09 16:49:36 · 289 阅读 · 0 评论 -
DP合集
1.一个100层的大厦,你手中有两个相同的玻璃球。从这个大厦的某一层扔下围棋子就会碎,用你手中的这两个玻璃围棋子,找出一个最优的策略,来得知那个临界层面原创 2014-05-20 18:56:19 · 1265 阅读 · 0 评论 -
【九度OJ合集】P1465-P1515
P1497import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.io.StreamTokenizer;public class Exercise1497{ public static void main(String[] args)原创 2014-09-04 16:43:53 · 443 阅读 · 0 评论 -
usaco/ 1.3 milk/barn1
package chapter1_3;/* ID: chicc991 LANG: JAVA TASK: milk */import java.io.BufferedWriter;import java.io.File;import java.io.FileReader;import java.io.FileWriter;import java.io.PrintWriter;原创 2014-06-05 15:58:43 · 421 阅读 · 0 评论 -
usaco/ 1.2 milk2/transform/namenum/palsquare/dualpal
/*ID: chicc991LANG: JAVATASK: milk2*/import java.io.BufferedWriter;import java.io.File;import java.io.FileReader;import java.io.FileWriter;import java.io.PrintWriter;import java.util.BitSet;原创 2014-04-22 21:08:15 · 614 阅读 · 0 评论 -
【九度OJ合集】P1000-P1049
P1000[java] view plaincopyimport java.util.Scanner; public class Exercise1000 { public static void main(String[] args) { Scanner sc = ne原创 2014-04-24 22:34:15 · 692 阅读 · 0 评论 -
【九度OJ合集】P1516-P1557
P1526import java.util.LinkedList;import java.util.Scanner;public class Exercise1526 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int in; int[] a; wh原创 2014-05-15 18:38:26 · 555 阅读 · 0 评论 -
【LeetCode】Word Break && Word Break II
Word Break:Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcod原创 2014-08-17 22:49:44 · 363 阅读 · 0 评论