m****g
发帖数: 2215 | 1 I only see ARG on real clear website.
Any other polls? Thank you. |
|
|
|
|
g****n
发帖数: 7494 | 5 最近的几个poll都是几百人的小样本
代表性有多高呢？ |
|
|
|
p****u
发帖数: 2596 | 8 cruz领先的都是几百个样本。。
最大的样本６０００个人的也是trump领先.
0ptimus (R)* 3/22 - 3/24 6182 LV 1.1 27 31 29 Trump +2 |
|
|
c********e
发帖数: 4283 | 10 我不在WI,但是Trump今天是赢定了。
根据Optimus Consulting 3/22-3/24的数据，Trump 在WI所有8个选区里有三个是领先
的，Cruz领先两个，Kasich领先一个，还有两个太close。这些数据是在最近Trump发力
扭转局面，momentum起来之前的数据。加上昨天ARG的新poll - Trump +10% over cruz
, 所以我很乐观得认为今天Trump将赢下WI 8个选区里的5个，并且将赢下全州。拿下33
票的delegates. |
|
|
m****g
发帖数: 2215 | 12 The Hill reported: Republican presidential candidate Donald Trump is ahead
by 9 points in Indiana ahead of the state's Tuesday primary, according to a
poll released Friday.
Trump has 41 percent support among likely GOP primary voters, the American
Research Group poll found, followed by Ted Cruz, at 32 percent, and John
Kasich, at 21 percent.
Trump is the top choice among the solely self-reported Republicans surveyed,
taking 42 percent compared to 34 percent for Cruz and 17 percent for Kasich
. |
|
|
|
m****g
发帖数: 2215 | 15 Yes, be cautious.
The IPFW/Downs Center democratic poll is included in RCA.
But the IPFW/Downs Center republican poll is not. |
|
发帖数: 1 | 16 This is a poll started calling even before NY. |
|
h*******n
发帖数: 8906 | 17 New Hampshire, ARG Poll:
Trump 48 ( 5)
Clinton 43
Johnson 4
第二个poll老床领先了 而且比例不小 |
|
a********9
发帖数: 3813 | 18 2016 Michigan Democratic Primary Polls
FOX - Clinton +27
ARG - Clinton +24
MONMOUTH - Clinton +13
final result: Sanders +1.5
Clinton |
|
C***0
发帖数: 1743 | 19 晚上开车，从一个apt里出来不知道限速，开到50左右被警察逮了，警察说这是35的限
速。。。刚又去案发地点看了下，我当时从apt里左转出来的，然后好像左转出来之后
很近的地方有一个限速牌（晚上的话估计比较难看见），然后我是在第二个限速牌出现
之前被拦下来了。。。这种情况可以argue不？用什么方法arge?
btw, 这是第一张被警察开的ticket...
谢谢谢谢！ |
|
q**j
发帖数: 10612 | 20 晚上孩子的birthday party结束以后，大家都睡了。我实在累的睡不着，就喝剩下的红
酒，闲着没事，就把车子的air filter, cabin air filter给换了。dealer昨天打算ch
arge我$150，结果我半个小时就搞定了。成本25块钱。然后继续搞wiper blade insert
change。这个还挺奇怪，忙了40多分钟才搞定。成本8块钱。dealer那里买是20块。估
计没人让dealer干这个。下来继续搞power steering fluid change。这个dealer要$12
5，我的成本是10块钱。大概一个小时吧。马上开始。
现在想想Acura挺惨的。一群穷customer想方设法省钱，dealer忽悠的嘴里吐白沫也赚不
到钱。不仅比不上mba，连Lexus也不如。因为买L的大部分动手能力比较差，还是油水多
一些。（当然这个是相对的，搞Toyota/Lexus的有很多高手。但是大妈太多了。） |
|
f*******n
发帖数: 696 | 21 他们的意思是不要call back,很可能就是最后paypal买单啦。现在你跟ebay argue arg
ue吧。 |
|
c****2
发帖数: 318 | 22 this arg shows where the problem comes from. |
|
w*******y
发帖数: 14 | 23 I am looking for a male roommate for my 2br/1.5bath apartment in South San Jos
e. The apartment is quite nice and clean. It is two levels，2个bedrooms and 1
full bathroom upstairs; living room, a half bathroom (without shower), and a l
arge kitchen downstairs. 有一个后院很宽敞。There is washer/dryer just outside
of the apartment. There is also a parking lot for the roommate (I asked the Ch
inese landlord to give me two parking lots when I came here).
It is within walking distance to longdrugs pharmacy, saf |
|
h*t
发帖数: 57 | 24 Spacious condo available in Morris Plains area, 2BR, 1 full bath, l
arge bedrooms and living room, 7 closets, all appliances included
Free use of exercise gym, tennis court and swimming pool in the complex.
Rental is $1400 per month + electricity.
Minimum lease 6 months, 1.5 months deposit, Available Oct 1
Located near Route 10 & 287, in Parisippany, near
Morris Plains and Morristown.
Please call 973-420-0237 |
|
a******h
发帖数: 19 | 25 I use dynamic programming to solve Q2. My solution required a sorted
integer array as input. The boolean array is the solution.
public static void main (String [] args) {
int [] intList = {1, 3, 5, 6, 8, 9, 11, 12};
boolean [] boolList = subsetSum(intList, 10);
System.out.println(Arrays.toString(intList));
System.out.println(Arrays.toString(boolList));
}
public static boolean [] subsetSum(int [] intList, int sum) {
if (su |
|
c**********r
发帖数: 472 | 26 using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Collections.Specialized;
namespace ConsoleApplication4
{
class Program
{
static void Main(string[] args)
{
Node node2000 = new Node();
node2000.Number = 2000;
Node lastNode = node2000;
for (int i = 1999; i >= 1; i--)
{
Node currentNode = new Node();
currentNode.Number |
|
s*********i
发帖数: 66 | 27 class Program
{
static void Main(string[] args)
{
string stra = "WXYZ";
string strb = "def";
new Program().combination(stra, 0, strb, 0);
}
private void combination(string a, int i, string b, int j)
{
Console.WriteLine(a[i].ToString() + b[j].ToString());
if (++j >= b.Length) {i += 1; j = 0;}
if (i >= a.Length) return;
combination(a, i, b, j);
}
} |
|
H*M
发帖数: 1268 | 28 就是 linux command: find #### |args grep ####
电梯那个，貌似不是OOP啊，给的条件不够吧，要算法的话 |
|
S*******n
发帖数: 1867 | 29 C# code 如下下
调用如下：
static void Main(string[] args)
{
int[] A = { 1, 2, 3, 4, 5, 6, 7, 8,8 };
int dup = FindDuplicateByBS(A, 0, A.Count() - 1);
Console.WriteLine(dup);
Console.ReadKey();
}
public static int FindDuplicateByBS(int[] IntArray, int p, int q)
{
//Assume the array has non negative numbers.
if (p == q)
{
return -1;
}
if (p == q - 1)
{
if (IntArray[p] == IntArray[q])
{
return IntArray[p];
}
else
{
return -1;
}
} |
|
I**A
发帖数: 2345 | 30 我用Java写的
public static void genKnuth(int m, int n)
{
Random myr = new Random();
for(int i=0; i
if((myr.nextInt() % (n-i)) < m){
System.out.print(i + " ");
m--;
}
}
public static void main(String[] args) {
genKnuth(5,20);
}
产生的总是多于5个。。
难道这个random function有问题？？？我觉得不应该啊。
而且我把你的解释和作者的解释又看了好几遍，还是没明白。。 |
|
g**t
发帖数: 3 | 31 硬想出来的，没什么值得总结的思路，应该work，也满足条件。大家测测吧
public class Longest10Substring {
public static void main(String[] args) {
calc(new int[] { 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0 });
calc(new int[] { 0 });
}
public static void calc(int[] a) {
int n = a.length;
int minority = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 1) {
cnt++;
}
}
if (cnt == 0 || cnt == n) {
print(a, 0, 0... 阅读全帖 |
|
b********e
发帖数: 693 | 32 来自主题: JobHunting版 - 再问一道题 extenal sort by using selection arg?
be |
|
b********r
发帖数: 118 | 33 用java写的 应该没问题了 需要四个指针
public class SumTest {
public static void main( String[] args ){
int[] a = {9, 7, 2};
int[] b = {6, 3, 1};
int k = 3;
int i = 0;
int i_1 = 1;
int j = 0;
int j_1 = 1;
int m = 1;
int current_sum=a[0]+b[0];
while(i
if(a[i]+b[i_1] > a[j_1]+b[j]){
if ( current_sum != a[i]+b[i_1]){
current_sum = a[i]+b[i_1];
|
|
s*****o
发帖数: 1540 | 34 一个经典问题：a vector x of n real numbers. find the max sum found in any
contiguous sub vector。
大家知道，programming pearl的解法是：
maxsofar = 0;
maxendinghere = 0;
for i = [0, n)
maxendinghere = max (maxendinghere + x[i], 0);
maxsofar = max (maxsofar, maxendinghere);
我改动一下，要输出究竟是那个sub vector，请大侠指教是不是正确。
public class MaxSubVector {
static public void findBigestSum(double[] x)
{
double maxsofar = 0;
double maxendinghere = 0;
int maxsofarlow = -1;
int maxso... 阅读全帖 |
|
h**********d
发帖数: 4313 | 35 再问下楼主那两个arg min 和max是什么？第一个数和最后一个？谢谢
楼上inorder那个方法应该是最优的
题。 |
|
g**********y
发帖数: 14569 | 36 radiochromatogram * suspensefulnesses = 289
public class WordProduct {
private final static String DIR = "src/test/resources/com/practice/
search";
public void search() {
int N = 30;
String content = FileHelper.readFile(DIR + "/WORD.LST");
String[] words = content.split("\n");
HashSet[] set = new HashSet[30];
HashMap map = new HashMap();
for (int i=0; i
set[i] = ... 阅读全帖 |
|
b*****e
发帖数: 474 | 37 我来抛砖吧。
O(n) 的解法大家都知道了吧。这个是O(n log n)的，比较直观点，
就是简单的Divide & Conquer，分别计算前半和后半的最大矩形面积，
然后和贯穿中间的最大矩形比较面积。我用最普通的前后扫描方法
来确定贯穿中间的最大矩形面积（O(n)时间）。所以这个算法和
MergeSort的情形一样，都是分成两个一半大小的子问题，然后O(n)
时间来合成。所以是O(nlogn)。
Java 程序：
public class histo {
public static int maxRect(int[] table ) {
return maxRect(table, 0, table.length-1);
}
public static int maxRect(int[] table, int start, int end) {
if ( start == end ) return table[start];
if ( start == end-1)
return Math.max(Math.max(ta... 阅读全帖 |
|
j*****u
发帖数: 1133 | 38 这个挺简单的，不要想复杂了
写了个int[][]的，如果要求任意type T可以在Serialize和Deserialize传入Write(T)和
Read(T)的delegate或者interface，因为serializer不可能知道如何读写任意一个type
// Test code
static void Main(string[] args)
{
var array = new int[][] { new int[] { 2, 6, 35 }, new int[] { 0 }, new int[] { 3, 76 } };
string file = @"C:\data.bin";
using (FileStream fs = new FileStream(file, FileMode.Create, FileAccess.Write))
{
Serialize(array, fs);
}
using (FileStream fs = new FileStream(file, FileMode.Open, File... 阅读全帖 |
|
s*******f
发帖数: 1114 | 39 using System;
using System.Collections.Generic;
using System.Text;
namespace MSC
{
class Program
{
//“bool F(string s, char ch1, char
ch2, int n)”
//The function determines whether
or not there exists an occurrence of
//ch1 and ch2 separated by a
distance of no more than n in the given
//string s, where s is ascii and
user entered (your function needs
//to work on any input.) The
function must be efficient and
//**optimized** for both space... 阅读全帖 |
|
y*********e
发帖数: 518 | 40 关于那个iterator的东西，若是用C#来yield return最是简单了。
using System;
using System.Collections.Generic;
public class InOrderTraverse
{
private BTree tree;
private Stack stack;
public InOrderTraverse(BTree tree) {
this.tree = tree;
this.stack = new Stack();
}
public IEnumerable GetEnumerator() {
BTree current = this.tree;
while (true) {
while (current != null) {
stack.Push(current);
curre... 阅读全帖 |
|
S******1
发帖数: 269 | 41 // Find the longest subarray with equal 1 and 0.
public static int[] longestSub(int[] inputArray) {
int length = inputArray.length;
int[][] record = new int[length][length];
//Initial
for (int i = 0; i < length; i++)
if (inputArray[i] == 1)
record[i][i] = 1;
else
record[i][i] = -1;
for (int i = 0; i < length; i++) {
for (int j = i; j < length; j++) {
if (i < j)
... 阅读全帖 |
|
g***s
发帖数: 3811 | 42 It is very quick even for n = Integer.MAX_VALUE;
public static void main(String arg[]){
preprocess();
int n=Integer.MAX_VALUE;
System.out.println("squares sum of " + n + " : ");
for (int num : getSquaresSum(n)){
System.out.print(" " + num);
}
System.out.println("\ntotal callCount= " + callCount);
}
public static Collection getSquaresSum(int n){
Stack cur = new Stack();
Stack阅读全帖 |
|
g***s
发帖数: 3811 | 43 public class MyTest2 {
static final int a[] = new int[]{-9,6,10000, 6, 3, 7, 1,2,5};
public static void main(String arg[]){
System.out.println("the min missing number is : " +
findMissingNum(a));
}
static private int findMissingNum(int a[]){
for (int i = 0 ; i< a.length; i++){
while (needMove(i,a))
move(i,a);
}
int i;
for (i = 0 ; i< a.length; i++){
if (a[i] != i+1 ) return i+1;
}
re... 阅读全帖 |
|
g**e
发帖数: 6127 | 44 激动啊，得到大牛肯定
不过你前面提到的"c(x)=在x左边最后一个比ax小的位置 c(x)=0 if all are larger
than ax"，我觉得这种情况c(x)=-1
这样后面算最大面积的时候 (b(x)-c(x)-1)*a(x)才正确
比如a={2,3}, b={2,2}, c={-1,0} 最大面积4
贴个完整的代码
public class LargestHistogramRectangleDP {
public static int largestHistogram(int[] a) {
int maxArea = 0;
int n = a.length;
int[] b = new int[n];
int[] c = new int[n];
b[n-1] = n;
fo... 阅读全帖 |
|
f*********i
发帖数: 197 | 45 我测试了一下，好像不行啊
我自己写了一个类
static class Mix{
private int a; double b; String c;
Mix(int a,double d,String c){
this.a=a;this.b=d;this.c=c;
}
public int hashCode(){
return 1;
}
}
在main函数中，我创建了两个一样的实例，但是hashtable认为他们是不一致的，我已
经重载了这个类的hashCode这个函数了啊。
public static void main(String[] args）
Mix m1 = new Mix(1,0.53,"yes");
Mix m2 = new Mix(1,0.52,"yes");
System.out.println(m1.hashCode());
System.out.pri... 阅读全帖 |
|
m***g
发帖数: 90 | 46 这个算法里生成的是 bst
12
/\
11 34
/\
22 45
/ \
43 67
/\
56 89
\
98
为啥不是:
12
/\
11 34
\ \
22 45
/ \
43 67
/\
56 89
\
98
bst的生成是先满足右子树么？
public static void main(String args[]) {
BinaryTreeTest b = new BinaryTreeTest();
int data[] = { 12, 11, 34, 45, 67, 89, 56, 43, 22, 98 };
BinaryTreeTest.Bin... 阅读全帖 |
|
r******r
发帖数: 700 | 47 我这个方法很笨。 谁能写个 O(n) 的？ 这个好像也是被 facebook 考了的。
// civic
private static boolean isCharPalindrome(String test) {
String stripped = test.toLowerCase().replaceAll("[^0-9a-zA-Z]", "");
for(int i = 0; i < stripped.length() / 2; i++) {
if(stripped.charAt(i) != stripped.charAt(stripped.length() - 1 -
i)) {
return false;
}
}
return true;
}
// ILLINOISURB
public static String longestPrefixPalindrome(String test){
Stri... 阅读全帖 |
|
m*****y
发帖数: 42 | 48 找零钱问题，可是最后那一分的有时候不准确，不知道为什么，请大牛们帮忙，谢了！
public class ChangeMoney
{
public static int[] changeMoney(double input, double price)
{
double deno[] =
{
10, 5, 1, 0.25, 0.10, 0.05, 0.01
};
int[] result = new int[deno.length];
double change = input - price;
for (int i = 0; i < deno.length; i++)
{
if (change / deno[i] > 1)
{
result[i] = (int) (change / deno[i]);
change = (do... 阅读全帖 |
|
s*********3
发帖数: 389 | 49 I wrote some Java code afterwards. It seems not very clean. Please comment.
import java.util.*;
//Assumptions:
//1. We can move either up or down or left or right at any point in time,
but not diagonally.
//2. One item in the matrix can not be used twice to compose of the pattern
string.
//3. If different routes lead to the same indexes of matrix items to compose
of the pattern string, display them.
//4. The maximum number of movable steps is (matrix.length - 1) + (matrix[0]
.length - 1) = matri... 阅读全帖 |
|
s********x
发帖数: 914 | 50 But how does the robot know?
Do I need to make it a command arg which is the file and its directory? |
|
