l****z
发帖数: 29846 | 1 By Katherine Hobson
A new survey of U.S. physicians finds they are decidedly pessimistic about
the health-care overhaul law, with 65% saying it will contribute to a
worsening of health-care quality over the next five years.
The survey, from Thomson Reuters and HCPlexus, which makes management
products for physicians, covers responses from nearly 3,000 physicians. It
was conducted — by fax — last fall.
Only 18% said they felt health-care would improve, with 17% seeing no change
. “The inclusion o... 阅读全帖 |
|
l****z
发帖数: 29846 | 2 Thirty percent of employers will definitely or probably stop offering health
benefits to their employees once the main provisions of President Obama's
federal health care law go into effect in 2014, a new survey finds.
The research published in the McKinsey Quarterly found that the number rises
to 50 percent among employers who are highly aware of the health care law.
McKinsey and Company, which identifies itself as a management consultant
that aims to help businesses run more productively and c... 阅读全帖 |
|
l****z
发帖数: 29846 | 3 By Noel Sheppard | July 21, 2011 | 17:24
In the past week, you couldn't swing a debt cat without hitting a press
report about how irresponsible the "Cut, Cap and Balance" bill passed by
House Republicans is.
A new CNN/ORC poll released a few hours ago finds the media very much on the
wrong side of public opinion concerning this issue:
23. In another proposal, Congress would raise the debt ceiling only if a
balanced budget amendment were passed by both houses of Congress and
substantial spending ... 阅读全帖 |
|
l****z
发帖数: 29846 | 4 By JESSICA E. VASCELLARO
SAN JOSE, Calif.—A federal court jury delivered a big win to Apple Inc.,
AAPL +0.09% finding that Samsung Electronics Co. 005930.SE -0.93% infringed
six of the Silicon Valley company's patents following a closely-watched
trial.
The nine-person jury found that several Samsung phones and tablets infringed
on Apple patents relating to touch-screen features, such as multi-touch
gestures and zooming. The jury also found Samsung devices infringed on Apple
design patents, such ... 阅读全帖 |
|
n******g
发帖数: 17225 | 5 http://www.nbcnews.com/news/us-news/clinton-broke-federal-rules
Democratic presidential candidate Hillary Clinton violated federal records
rules through her use of a private email server while she was secretary of
state, a State Department audit has concluded.
"At a minimum, Secretary Clinton should have surrendered all emails dealing
with Department issues before leaving government service," says an audit by
the State Department Inspector General, obtained by NBC News.
"Because she did not do s... 阅读全帖 |
|
l*********o
发帖数: 3091 | 6 Trump本来说的就是find those emails，not hack, he didn't say hack. 意思是
those emails are already hacked, now exist somewhere, Russia please go and
find them. |
|
b********n
发帖数: 38600 | 7 【 以下文字转载自 Military 讨论区 】
发信人: beijingren (to thine own self be true), 信区: Military
标 题: 荣炮：What Will Weapons Inspectors Find in Syria…And Does it Matter?
发信站: BBS 未名空间站 (Tue Apr 24 09:54:43 2018, 美东)
We should share Rep. Massie's concerns.
US and French authorities have suggested that videos shared on the Internet
by the US-funded White Helmets organization were sufficient proof of the
attack. If social media postings are these days considered definitive
intelligence, why are we still spending ... 阅读全帖 |
|
j*****n
发帖数: 1781 | 8 ☆─────────────────────────────────────☆
ChinaPD (警察叔叔) 于 (Sun Oct 14 20:03:16 2007) 提到:
1. My recent experience was to pick a car shop from www.CarTalk.com, which
has some reviews for car shops. I usually pick the one with more positive
reviews and comments. To find a car shop ---
http://www.cartalk.com/content/mechx/find.html
2. I used to use AAA-approved car shops too. It is officially called "Auto
Club–Approved Auto Repair Program". For CA, the link is:
http://www.aaa-calif.com/auto/mai |
|
w********n
发帖数: 524 | 9 Hit and Run:
I have two witnesses. And narrow down the color of the car. now I have the
suspected plate numbers from the communicate gate control office.
Can I find the color and maker of the car?
If I report this to insurance company, will they be able to find out this
information?
thanks, |
|
p*********w
发帖数: 23432 | 10 ipad被盗通过Find my iphone找到俩女贼zz
被盗事件经过：ipad 3G
本人在义乌国际商贸城一区市场经商，2011年4月5日清明节，据说今天是黄道吉日，看
起来真的好吉利。
下午13：15左右，我在玩刚买的x-plane for ipad，这时进来兩女的，一个顺眼的，一
个丑的，我把ipad放在了桌子上。她们站在门口看样品，看起来是想拿货的，就在那里
谈。
过了一会那丑点的走过店内桌子边上坐下了，这时我背对她站在门口与顺眼的在交谈，
我也没有起疑，太疏忽了。过了一会那丑的偷到ipad后，兩人放下样品就匆忙离开，我
把样品挂回去后，坐回桌子边才发现ipad没了。
赶紧出去找这兩人，转了一圈她们早已经没影了(逼我买ipad2吗）。这时想到设置过
find my iphone定位，虽然没报太大希望，试试总没错了。室内是没多大希望，室外因
为3G版有GPS+agps辅助，还是比较准的。
回到店里，上mac，打开me.com进行定位，本人在A点(见附图)，过一会定出来ipad在B
位置。先锁定，设个密码。然后拿着iphone3G去B点，到那没发现兩人，拿出iphone定
，移动... 阅读全帖 |
|
a******4
发帖数: 112 | 11 Where can I find the external reviewers for tenure promotion? My department
needs me to come with a list and they will choose. Do I need to find
somebody who has a good relationship with me? Any suggestions are
appreciated. |
|
x******3
发帖数: 23 | 12 Sorry for being not able to input Chinese.
I have a question where I can find some interview question threads on
JobHunting boards. I tried "Jinghua" area, but can't find some.
Thanks in advance |
|
C*Y
发帖数: 736 | 13 Interview questions for front-end web developer.
1. Given a node of a non-binary tree, find all nodes on the same level. Choose any
language and data structure you prefer to implement this.
2. Given a node of a DOM tree, find all nodes on the same level. Use javascript and jquery library to implement this, write as less code as possible. |
|
c**y
发帖数: 172 | 14 Thanks for your solution. Yours is the same as the solution given in
CareerCup. So it shares the same problem as mentioned above, that is, it
only finds all paths such that one end must be in a subtree with the other
end as root. Can your solution find other paths in which two ends are cross
different subtrees? I will appreciate you very much if you could clarify an
answer for that case. Many thanks ahead. |
|
l*****o
发帖数: 214 | 15 一点想法，不知到对不对：
用doubly linked list
step 1. scan text, if in the target word set, add to doubly linked list,
until the doubly linked list has all the target words: you get [word1, word1
, word2, word1, word1, word3]
step 2. from the end of the linked list, go backwards, until find all the
words in target word set, remove the words before, and the result is a
probably shorter list with first element A: you get [word2, word1, word1,
word3], and record the span
step 3. keep scanning the text, push wor... 阅读全帖 |
|
g***s
发帖数: 3811 | 16 m = length of the array
first time, skip all numbers > m
inplance swap, scan find all mising number beteen 1 and m.
then, only check all numbers > m,
inplance to swap these number to (i-1)-m th
scan find all missing number between m+1 and n |
|
j**y
发帖数: 462 | 17 Find a pair of numbers that sums up to zero (or any other number), then
find three (and then four) numbers that sum up to zero
有什么好的方法？ 多谢 |
|
g******0
发帖数: 221 | 18 2 numbers sum up to k is simple.
How to find 3 numbers sum up to K?, 4 numbers sum up to K? 5 numbers
etc...
How to find a subset of numbers that add up to K?
What's the running time? |
|
f****4
发帖数: 1359 | 19 O(m+n), O(k), O(lg m + lg n)解法见
http://www.ihas1337code.com/2011/01/find-k-th-smallest-element-
O(lgk)的解法只是2分查找需要查找的范围，而不是0～m或者0～n
文字解释可以看我的回答
http://www.mitbbs.com/article_t1/JobHunting/31911109_0_1.html
#include
bool try_find_kth(int a[], int lowa, int higha, int b[], int lowb, int highb
, int k)
{
while(lowa<=higha)
{
int mid=lowa+(higha-lowa)/2;
if(a[mid]b[k-mid-2]))
{
printf("find %dth %d\n",k,a[mid]);
return true;
... 阅读全帖 |
|
a********r
发帖数: 218 | 20 There are many large files, how to fast find the phone numbers from these
files? Phone number has two formats:
0123456789
012 345 6789
He gives examples of file in google document:
File 1:
From: s***[email protected]
To: b*[email protected]
Subject: Request #12365712
Date: Fri, 2 Sep 2011 10:34:83
Hi Bob
You can contact our sales department on 9379273429 or our marketing
department on 038 739 7392.
Regards
Jenny
File 2:
ACME consulting
Contact information:
阅读全帖 |
|
g*********g
发帖数: 114 | 21 1.Write a small project
Open folder and Open every file.
You can think and set all the conditions about phone number.
In this case, i would like to set phone number format as follows.
FIRST OF ALL, DELTE SPACE, THUS , USE REPLACE method.
Then , replace all the '-', then replace all the '(', then replace all the '
)',
Okay, then use indexof , might be instr, to find 0123456789.
And if found, keep folder path and file name to save into file by using
streamwriter class.
2. the file looks like EMAIL... 阅读全帖 |
|
c**j
发帖数: 103 | 22 ding! Can we do it without sorting??
请问Bayesian1， 还有link没？
加个条件： 这个题如果还要要求 答案是*连续位置的*的subarray呢？
e.g.:
input: 4,5,1,5,7,4,3,6,3,1,9
sort以后1，1，3，3，4，4，5，5，6，7，9
output{5,7,4,3,6}
check careercup:
http://www.careercup.com/question?id=11256218
Microsoft Interview Question about Algorithm asm on October 19, 2011
you have an array of integers, find the longest
subarray which consists of numbers that can be arranged in a sequence, e.g.:
a = {4,5,1,5,7,4,3,6,3,1,9}
max subarray = {5,7,4,3,6}
39
http:/... 阅读全帖 |
|
m********l
发帖数: 4394 | 23 看了下别人的答案， 顺便问下这题目的意思是
1) Find (i,j) in array A to max (j - i) for ANY j, i as long as Aj>Ai
2) Find (i,j) in array A to max (j - i) for ALL j, i such that Aj>Ai
e.g.
a = 1 3 2 4
what's the expected result |
|
k***t
发帖数: 276 | 24 看到一个题和一个答案。不太理解。
1.What does it mean that "tree representation is in Linked list format"?
Is there a standard way to represent a tree with a linked list? Or does it
just refer to the fact that TreeNode has left and right child link/pointers.
2. "When we thread a binary tree while doing preorder traversal, it wont
result in any cycle."
Is there a standard way to "thread' a binary tree? There is no "cycle"
concept at all in normal tree traversal, isn't it?
=======================================
S... 阅读全帖 |
|
Y******l
发帖数: 19 | 25 Given an array of N integers from range ［0, N] and one is missing. Find the
missing number.
1) how to find the missing number if the element of array is integer value
2) if the element of the array is a bit vector, presenting the integer
number. for example, 000 --> 0, 010 --> 2. |
|
m****r
发帖数: 141 | 26 Given a sequence of data (with duplicates), move a fix-sized window along
the data sequence and find mode in the window at each iteraion, where the
oldest data is removed and a new data is inserted to the window.
I cannot find better solutions here.
My idea: Use a hashtable, key is the data, key's data is the frequency of
the data occuring in the window.
At the first iteration, iterate each data in the window and put it to the
hashtable, meanwhile cout the frequency of each data. After that, tra... 阅读全帖 |
|
t*******e
发帖数: 274 | 27 如果把
(hset.find(word.substr(i,n-i)) != hset.end() || IsCompositeWord(word.
substr(i,n-i))))
改为：
(hset.find(word.substr(i)) != hset.end() || IsCompositeWord(word.
substr(i))))
有什么区别？ |
|
t*******e
发帖数: 274 | 28 如果把
(hset.find(word.substr(i,n-i)) != hset.end() || IsCompositeWord(word.
substr(i,n-i))))
改为：
(hset.find(word.substr(i)) != hset.end() || IsCompositeWord(word.
substr(i))))
有什么区别？ |
|
t*******e
发帖数: 274 | 29 如果把
(hset.find(word.substr(i,n-i)) != hset.end() || IsCompositeWord(word.
substr(i,n-i))))
改为：
(hset.find(word.substr(i)) != hset.end() || IsCompositeWord(word.
substr(i))))
有什么区别？ |
|
t*******e
发帖数: 274 | 30 如果把
(hset.find(word.substr(i,n-i)) != hset.end() || IsCompositeWord(word.
substr(i,n-i))))
改为：
(hset.find(word.substr(i)) != hset.end() || IsCompositeWord(word.
substr(i))))
有什么区别？ |
|
z********i
发帖数: 568 | 31 /* find the first missing postivie integer in array A with n elements
return x if one postive integer in [1..n] is missing;
return 0 otherwise;
*/
int findFirstMissingPositiveInteger(int A[], int n){
int x,i,val,index;
/* rearrange the input array A such that
B[i]=i+1 if i+1 exist in array A, or
B[i]=A[i] if i+1 does not exist in array A
where B is the array rearraged from A.
*/
for(i=0;i
/* put A[i] in A[A[i]-1] if 1<=A[i]<=n && A[i]!=i+1 */
val=A[i... 阅读全帖 |
|
z********i
发帖数: 568 | 32 /* find the first missing postivie integer in array A with n elements
return x if one postive integer in [1..n] is missing;
return 0 otherwise;
*/
int findFirstMissingPositiveInteger(int A[], int n){
int x,i,val,index;
/* rearrange the input array A such that
B[i]=i+1 if i+1 exist in array A, or
B[i]=A[i] if i+1 does not exist in array A
where B is the array rearraged from A.
*/
for(i=0;i
/* put A[i] in A[A[i]-1] if 1<=A[i]<=n && A[i]!=i+1 */
val=A[i... 阅读全帖 |
|
f*******n
发帖数: 12623 | 33 Find k smallest numbers in a list of size n:
* Use max-heap of size k, iterate through list
O(n log k)
* Turn entire list into min-heap, then pop k times
O(n + k log n)
* Use worst-case linear-time selection algorithm to find the value of the k'
th smallest element, then partition the list with this value, and take the
first k elements
O(n) |
|
Y********f
发帖数: 410 | 34 刚做了这道题，leetcode上为了不调用find kth elments两次写了一个比较复杂的。我
写了一个稍微简单点的，实际上也是基于find kth element.
double median2Array(int* arrA, int lenA, int* arrB, int lenB, int k, int
isEven)
{
if (lenA == 0)
return isEven ? (arrB[k-1] + arrB[k]) / 2.0 : arrB[k-1];
else if (lenB == 0)
return isEven ? (arrA[k-1] + arrA[k]) / 2.0 : arrA[k-1];
else if (k == 1)
{
vector vect(min(2, lenA) + min(2, lenB));
copy(arrA, arrA + min(2, lenA), vect.begin());
copy(ar... 阅读全帖 |
|
Y********f
发帖数: 410 | 35 刚做了这道题，leetcode上为了不调用find kth elments两次写了一个比较复杂的。我
写了一个稍微简单点的，实际上也是基于find kth element.
double median2Array(int* arrA, int lenA, int* arrB, int lenB, int k, int
isEven)
{
if (lenA == 0)
return isEven ? (arrB[k-1] + arrB[k]) / 2.0 : arrB[k-1];
else if (lenB == 0)
return isEven ? (arrA[k-1] + arrA[k]) / 2.0 : arrA[k-1];
else if (k == 1)
{
vector vect(min(2, lenA) + min(2, lenB));
copy(arrA, arrA + min(2, lenA), vect.begin());
copy(ar... 阅读全帖 |
|
z****p
发帖数: 18 | 36 I think backtou has already given the answer. Let me elaborate it:
-Naive approach: find the smallest element in the array, "swap" it to the
tail; then find the 2nd smallest element, "swap" it to the tail; ...
-Improvement, if the first K elements are already in an increasing order in
the original array, then in the naive approach, we can simply start with the
K+1-th smallest element
-So the minimal number of "swaps" is N-K, where K is the longest prefix of
the sorted array that are already in t... 阅读全帖 |
|
a*******n
发帖数: 64 | 37 Given the Dijkstra's algorithm (finding the shortest path) and a acylic
graph, how can we modify the graph to find the longest path?
Didn't think of any good answer to this one? Anyone has an idea? |
|
s*****n
发帖数: 839 | 38 【 以下文字转载自 Postdoc 讨论区 】
发信人: sadrain (雨做的云), 信区: Postdoc
标 题: How to find local schools and research organizations?
发信站: BBS 未名空间站 (Thu Jul 18 13:54:20 2013, 美东)
Anyone knows how to find local schools and research organizations that might
sponsor H1B?
Thank you very much in advance. |
|
|
s********u
发帖数: 1109 | 40 做了一下7.6，就是找经过点最多的直线。
答案给的比较复杂，是用一个 >的hashmap，在斜率匹配的情况
下，再去vector找匹配的line，而且感觉有bug，在匹配斜率的时候没有考虑斜率无穷
大的情况。
我想了一下C++的做法，比较直观的做法是建立 的hashtable,然后重载一下
预算符，当斜率差和截距差都小于eps = 0.0001的时候视作两条线是同一条线。
但是因为重载这一块不太熟，不知道写的对不对，请大牛们指点一下：
//Given a two-dimensional graph with points on it,find a line which passes
the most number of points.
class Line{
private:
double slope;
double intercept;
bool infinity_slope;
static double eps;
public:
... 阅读全帖 |
|
m******t
发帖数: 273 | 41 【 以下文字转载自 Statistics 讨论区 】
发信人: myregmit (myregmit), 信区: Statistics
标 题: find distribution paramters only by data mean and std. dev.
发信站: BBS 未名空间站 (Mon Mar 17 17:14:15 2014, 美东)
I need to estimate a truncated gamma distribution paramters (shape , scale).
But, I only know the data mean and std. dev. I do not know the dat set.
Given the mean and std. dev. of a data set from a trucnated gamma
distribution, how to find shape and scale of the distribution parameters ?
I know MLE may be sueful for ... 阅读全帖 |
|
j********8
发帖数: 10 | 42 //Best first search, time complexity O(klog(n)). The size of heap is at most
2*n. Every time an element is popped from the heap or inserted to the heap,
O(log(n)). We need to do the pop and insert operations k times. So the time
complexity is O(klog(n)).
//Space complexity O(n), because there are at most 2*n nodes in the priority
queue.
struct node
{
int index;
int val;
node(int index_, int val_): index(index_), val(val_){}
bool operator > (const node& other) const
{
... 阅读全帖 |
|
j********8
发帖数: 10 | 43 //Best first search, time complexity O(klog(n)). The size of heap is at most
2*n. Every time an element is popped from the heap or inserted to the heap,
O(log(n)). We need to do the pop and insert operations k times. So the time
complexity is O(klog(n)).
//Space complexity O(n), because there are at most 2*n nodes in the priority
queue.
struct node
{
int index;
int val;
node(int index_, int val_): index(index_), val(val_){}
bool operator > (const node& other) const
{
... 阅读全帖 |
|
l******9
发帖数: 579 | 44 I need to find a file (tar.gz) in linux.
I logged in as admin and ran:
find / type f -iname "myfile.tar.gz"
But, I got permission denied in all folders.
Any help would be appreciated. |
|
S*******C
发帖数: 822 | 45 以下的O(n) time, O(1) space解法还能再简化吗？
Kth Largest Element
18%
Accepted
Find K-th largest element in an array.
Note
You can swap elements in the array
Example
In array [9,3,2,4,8], the 3rd largest element is 4
In array [1,2,3,4,5], the 1st largest element is 5, 2nd largest element is 4
, 3rd largest element is 3 and etc.
Challenge
O(n) time, O(1) space
class Solution {
public static void main(String args[]) {
Solution test = new Solution();
int[] a = { 5, 4, 1, 3, 2};
Arra... 阅读全帖 |
|
|
h****n
发帖数: 1093 | 47 void dfs(unordered_map>& graph, unordered_map
int>& visit, string ip)
{
visit[ip] = 1;
for(int i = 0; i < graph[ip].size(); i++)
{
if(visit[graph[ip][i]] == 0)
{
dfs(graph, visit, graph[ip][i]);
}
}
visit[ip] = 2;
}
vector get_unique_ips(vector ip_pairs)
{
unordered_map> graph;
unordered_map>::iterator it;
unordered_map visit;
vector res;
for(int i = 0; i < ip_pai... 阅读全帖 |
|
b**********5
发帖数: 7881 | 48 有一次去中国公司面试， 被问到这题， 我说就是connected component， DFS， BFS
， union find 都可以
然后面试元， 一个猥琐男， 就是死活不让我写， 说union find 太复杂， 你能30分
钟写完啊， 我说可以啊
然后他还是死活不让我写， 说你这个太复杂。。 再想想。。
I AM NOT MAKING THIS SHIT UP!!!! |
|
s**8
发帖数: 67 | 49 I爱宝宝版,I like宝妈s ,too. so i come back again.
Up date , Just come back from court, i don’t know why this case dismiss
again today? and that landlord lady take more bill to me, about 6800$ repair
fee. Next court time on Jan 30, 2012.
I want to find a free lawer, the lawer fee pay by government. have more
socive worker. another question find a interpreter , this fee pay by court.
About long case http://www.mitbbs.com/article_t/Law/31196663.html How can I make my money back, and win back case
Inter... 阅读全帖 |
|
f*******e
发帖数: 3433 | 50 In light of the recent suicides of several Palo Alto teens, the Center for
Disease Control and Prevention (CDC) began an epidemiological study in
February 2016 that investigated previous youth suicide clusters. Last week,
the CDC released preliminary findings of their study, which revealed that
mental health problems, recent crises and problems at school were major
factors in the suicides of the 232 youths throughout Santa Clara County the
CDC investigated.
The CDC’s research revealed that 46 pe... 阅读全帖 |
|
