static int CoinTossEndAmount(int betAmount, String coinTossResults) { if (betAmount <=0 || coinTossResults.length() == 0) return betAmount; long Amount = betAmount; long onebet = 1; for (int i=0; i<coinTossResults.length(); i++) { if (coinTossResult…

类似BackpackII问题 static int maximize_loot(int[] gold, int[] silver) { int[][] res = new int[gold.length+silver.length+1][10001]; res[0][0] = 0; for (int i=1; i<=gold.length; i++) { for (int j=0; j<=10000; j++) { res[i][j] = Math.max(res[i-1][j], (j>…

static LinkedListNode removeDuplicates(LinkedListNode list) { LinkedListNode cur = list; HashSet<Integer> set = new HashSet<Integer>(); set.add(list.val); while (cur.next != null) { if (!set.contains(cur.next.val)) { set.add(cur.next.val); cur…

这道题再次证明了这种细节的题目,画个图容易搞清楚 import java.util.Scanner; public class Solution2 { static int DateOfWeekday(int date, int weekday) { int cur = date%7; int res = 0; int dif = 0; if (weekday > 0) { dif = 7*((weekday-1)/7) + (weekday%7-cur>0? weekday%7-cur :…

Combination Sum I 那道题的变体 /* * Complete the function below. */ static int is_score_possible(int score, int[] increments) { Arrays.sort(increments); ArrayList<Integer> res = new ArrayList<Integer>(); res.add(0); helper(res, increments, score, 0)…

思路:这道题要观察,举个例子,1 2 * * 3 * 4  5 * * 6 7 * 8 * *, 用Stack,先序遍历,遇到数字就入栈,如果遇到 * *,说明栈顶节点是叶子节点,一条根到叶子的路径这时候就存在于栈之中,只要计算栈的size(),就知道当前这条路径的深度,树的height就是这些深度的最大值. 空格的引入增添了不少判断上的麻烦, 比如: ab * *, 这棵树的height是1 而不是2. 在遍历节点的时候需要注意取空格之前的所有元素一起看 第三遍办法:倒序读数组,用stack存…

题目链接: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1269 10328 - Coin Toss Time limit: 3.000 seconds 问题描述 Toss is an important part of any event. When everything becomes equal toss is the ultim…

Coin Toss Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVA. Original ID: 1032864-bit integer IO format: %lld      Java class name: Main   Toss is an important part of any event. When everything becomes equal toss is the ul…

有n张牌,求出至少有k张牌连续是正面的排列的种数.(1=<k<=n<=100) Toss is an important part of any event. When everything becomes equal toss is the ultimate decider. Normally a fair coin is used for Toss. A coin has two sides head(H) and tail(T). Superstition may work in…

题目链接 概率问题,像是概率论上学的均匀分布,是不是呢,忘了... 概率同面积有关系,我写的各种搓,然后此题格式十分变态,=前有的时候俩空格,有的时候一个空格.代码各种搓. #include <cstdio> #include <cstring> #include <iostream> #include <cmath> #include <algorithm> using namespace std; #define PI 3.141592653…