Settling Salesman Problem 旅行者问题

Problem Description
After travelling around for years, Salesman John has decided to settle. He wants to build a new house close to his customers, so he doesn't have to travel as much any more. Luckily John knows the location of all of his customers.
All of the customers' locations are at (distinct) integer coordinates. John's new house should also be built on integer coordinates, which cannot be the same as any of the customers' locations. Since John lives in a large and crowded city, the travelling distance to any customer is the Manhattan distance: |x - xi| + |y - yi|, where (x, y) and (xi, yi) are the coordinates of the new house and a customer respectively.
What is the number of locations where John could settle, so the sum of the distance to all of his customers is as low as posible?

Input
On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test case:

One line with an integer n (1 <= n <= 2 000): the number of customers John has.

n lines with two integers xi and yi (-1 000 000 000 <= xi, yi <= 1 000 000 000): the coordinates of the i-th customer.

Output
For each test case:

Two space-separated integers: the minimum summed distance to all customers, and the number of spots on which John can build his new house to achieve this minimum.

Sample Input
2
4
1 -3
0 1
-2 1
1 -1
2
-999888777 1000000000
1000000000 -987654321

Sample Output
10 4
3987543098 3975087573110998514

Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
其他相关推荐
Settling Salesman Problem 的问题

Problem Description After travelling around for years, Salesman John has decided to settle. He wants to build a new house close to his customers, so he doesn't have to travel as much any more. Luckily John knows the location of all of his customers. All of the customers' locations are at (distinct) integer coordinates. John's new house should also be built on integer coordinates, which cannot be the same as any of the customers' locations. Since John lives in a large and crowded city, the travelling distance to any customer is the Manhattan distance: |x - xi| + |y - yi|, where (x, y) and (xi, yi) are the coordinates of the new house and a customer respectively. What is the number of locations where John could settle, so the sum of the distance to all of his customers is as low as posible? Input On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test case: One line with an integer n (1 <= n <= 2 000): the number of customers John has. n lines with two integers xi and yi (-1 000 000 000 <= xi, yi <= 1 000 000 000): the coordinates of the i-th customer. Output For each test case: Two space-separated integers: the minimum summed distance to all customers, and the number of spots on which John can build his new house to achieve this minimum. Sample Input 2 4 1 -3 0 1 -2 1 1 -1 2 -999888777 1000000000 1000000000 -987654321 Sample Output 10 4 3987543098 3975087573110998514

Settling Salesman Problem 的代码编写实现

Problem Description After travelling around for years, Salesman John has decided to settle. He wants to build a new house close to his customers, so he doesn't have to travel as much any more. Luckily John knows the location of all of his customers. All of the customers' locations are at (distinct) integer coordinates. John's new house should also be built on integer coordinates, which cannot be the same as any of the customers' locations. Since John lives in a large and crowded city, the travelling distance to any customer is the Manhattan distance: |x - xi| + |y - yi|, where (x, y) and (xi, yi) are the coordinates of the new house and a customer respectively. What is the number of locations where John could settle, so the sum of the distance to all of his customers is as low as posible? Input On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test case: One line with an integer n (1 <= n <= 2 000): the number of customers John has. n lines with two integers xi and yi (-1 000 000 000 <= xi, yi <= 1 000 000 000): the coordinates of the i-th customer. Output For each test case: Two space-separated integers: the minimum summed distance to all customers, and the number of spots on which John can build his new house to achieve this minimum. Sample Input 2 4 1 -3 0 1 -2 1 1 -1 2 -999888777 1000000000 1000000000 -987654321 Sample Output 10 4 3987543098 3975087573110998514

Settling Salesman Problem 怎么做呢

Problem Description After travelling around for years, Salesman John has decided to settle. He wants to build a new house close to his customers, so he doesn't have to travel as much any more. Luckily John knows the location of all of his customers. All of the customers' locations are at (distinct) integer coordinates. John's new house should also be built on integer coordinates, which cannot be the same as any of the customers' locations. Since John lives in a large and crowded city, the travelling distance to any customer is the Manhattan distance: |x - xi| + |y - yi|, where (x, y) and (xi, yi) are the coordinates of the new house and a customer respectively. What is the number of locations where John could settle, so the sum of the distance to all of his customers is as low as posible? Input On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test case: One line with an integer n (1 <= n <= 2 000): the number of customers John has. n lines with two integers xi and yi (-1 000 000 000 <= xi, yi <= 1 000 000 000): the coordinates of the i-th customer. Output For each test case: Two space-separated integers: the minimum summed distance to all customers, and the number of spots on which John can build his new house to achieve this minimum. Sample Input 2 4 1 -3 0 1 -2 1 1 -1 2 -999888777 1000000000 1000000000 -987654321 Sample Output 10 4 3987543098 3975087573110998514

Settling Salesman Problem 是怎么写呢

Problem Description After travelling around for years, Salesman John has decided to settle. He wants to build a new house close to his customers, so he doesn't have to travel as much any more. Luckily John knows the location of all of his customers. All of the customers' locations are at (distinct) integer coordinates. John's new house should also be built on integer coordinates, which cannot be the same as any of the customers' locations. Since John lives in a large and crowded city, the travelling distance to any customer is the Manhattan distance: |x - xi| + |y - yi|, where (x, y) and (xi, yi) are the coordinates of the new house and a customer respectively. What is the number of locations where John could settle, so the sum of the distance to all of his customers is as low as posible? Input On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test case: One line with an integer n (1 <= n <= 2 000): the number of customers John has. n lines with two integers xi and yi (-1 000 000 000 <= xi, yi <= 1 000 000 000): the coordinates of the i-th customer. Output For each test case: Two space-separated integers: the minimum summed distance to all customers, and the number of spots on which John can build his new house to achieve this minimum. Sample Input 2 4 1 -3 0 1 -2 1 1 -1 2 -999888777 1000000000 1000000000 -987654321 Sample Output 10 4 3987543098 3975087573110998514

Settling Salesman Problem 怎么做的呢

Problem Description After travelling around for years, Salesman John has decided to settle. He wants to build a new house close to his customers, so he doesn't have to travel as much any more. Luckily John knows the location of all of his customers. All of the customers' locations are at (distinct) integer coordinates. John's new house should also be built on integer coordinates, which cannot be the same as any of the customers' locations. Since John lives in a large and crowded city, the travelling distance to any customer is the Manhattan distance: |x - xi| + |y - yi|, where (x, y) and (xi, yi) are the coordinates of the new house and a customer respectively. What is the number of locations where John could settle, so the sum of the distance to all of his customers is as low as posible? Input On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test case: One line with an integer n (1 <= n <= 2 000): the number of customers John has. n lines with two integers xi and yi (-1 000 000 000 <= xi, yi <= 1 000 000 000): the coordinates of the i-th customer. Output For each test case: Two space-separated integers: the minimum summed distance to all customers, and the number of spots on which John can build his new house to achieve this minimum. Sample Input 2 4 1 -3 0 1 -2 1 1 -1 2 -999888777 1000000000 1000000000 -987654321 Sample Output 10 4 3987543098 3975087573110998514

Settling Salesman Problem是怎么解答的

Problem Description After travelling around for years, Salesman John has decided to settle. He wants to build a new house close to his customers, so he doesn't have to travel as much any more. Luckily John knows the location of all of his customers. All of the customers' locations are at (distinct) integer coordinates. John's new house should also be built on integer coordinates, which cannot be the same as any of the customers' locations. Since John lives in a large and crowded city, the travelling distance to any customer is the Manhattan distance: |x - xi| + |y - yi|, where (x, y) and (xi, yi) are the coordinates of the new house and a customer respectively. What is the number of locations where John could settle, so the sum of the distance to all of his customers is as low as posible? Input On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test case: One line with an integer n (1 <= n <= 2 000): the number of customers John has. n lines with two integers xi and yi (-1 000 000 000 <= xi, yi <= 1 000 000 000): the coordinates of the i-th customer. Output For each test case: Two space-separated integers: the minimum summed distance to all customers, and the number of spots on which John can build his new house to achieve this minimum. Sample Input 2 4 1 -3 0 1 -2 1 1 -1 2 -999888777 1000000000 1000000000 -987654321 Sample Output 10 4 3987543098 3975087573110998514

Settling Salesman Problem

Problem Description After travelling around for years, Salesman John has decided to settle. He wants to build a new house close to his customers, so he doesn't have to travel as much any more. Luckily John knows the location of all of his customers. All of the customers' locations are at (distinct) integer coordinates. John's new house should also be built on integer coordinates, which cannot be the same as any of the customers' locations. Since John lives in a large and crowded city, the travelling distance to any customer is the Manhattan distance: |x - xi| + |y - yi|, where (x, y) and (xi, yi) are the coordinates of the new house and a customer respectively. What is the number of locations where John could settle, so the sum of the distance to all of his customers is as low as posible? Input On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test case: One line with an integer n (1 <= n <= 2 000): the number of customers John has. n lines with two integers xi and yi (-1 000 000 000 <= xi, yi <= 1 000 000 000): the coordinates of the i-th customer. Output For each test case: Two space-separated integers: the minimum summed distance to all customers, and the number of spots on which John can build his new house to achieve this minimum. Sample Input 2 4 1 -3 0 1 -2 1 1 -1 2 -999888777 1000000000 1000000000 -987654321 Sample Output 10 4 3987543098 3975087573110998514

Population

It is always exciting to see people settling in a new continent. As the head of the population management office, you are supposed to know, at any time, how people are distributed in this continent. The continent is divided into square regions, each has a center with integer coordinates (x, y). Hence all the people coming into that region are considered to be settled at the center position. Given the positions of the corners of a rectangle region, you are supposed to count the number of people living in that region. Input Your program must read inputs from the standard input. Since there are up to 32768 different regions and possibly even more queries, please use "scanf" and "printf" instead of "cin" and "cout" to avoid timeout. The character "I" in a line signals the coming in of new groups of people. In the following lines, each line contains three integers: X, Y, and N, where X and Y (1 <= X, Y <= 20000) are the coordinates of the region's center, and N (1 <= N <= 10000) is the number of people coming in. The character "Q" in a line signals the query of population. The following lines each contains four numbers: Xmin, Xmax, Ymin, Ymax, where (Xmin, Ymin) and (Xmax, Ymax) are the integer coordinates of the lower left corner and the upper right corner of the rectangle, respectively. The character "E" signals the end of a test case. Process to the end of file. Output For each "Q" case, print to the standard output in a line the population in the given rectangle region. That is, you are supposed to count the number of people living at all the positions (x, y) such that Xmin <= x <= Xmax, and Ymin <= y <= Ymax. Sample Input I 8 20 1 4 5 1 10 11 1 12 10 1 18 14 1 Q 8 10 5 15 8 20 10 14 I 7 6 1 10 3 2 7 2 1 2 3 2 10 3 1 Q 2 20 2 20 E Sample Output 1 3 12

Money Matters 判定的问题

Problem Description Our sad tale begins with a tight clique of friends. Together they went on a trip to the picturesque country of Molvania. During their stay, various events which are too horrible to mention occurred. The net result was that the last evening of the trip ended with a momentous exchange of "I never want to see you again!"s. A quick calculation tells you it may have been said almost 50 million times! Back home in Scandinavia, our group of ex-friends realize that they haven't split the costs incurred during the trip evenly. Some people may be out several thousand crowns. Settling the debts turns out to be a bit more problematic than it ought to be, as many in the group no longer wish to speak to one another, and even less to give each other money. Naturally, you want to help out, so you ask each person to tell you how much money she owes or is owed, and whom she is still friends with. Given this information, you're sure you can gure out if it's possible for everyone to get even, and with money only being given between persons who are still friends. Input The first line contains two integers, n (2 <= n <= 10000), and m (0 <= m <= 50000), the number of friends and the number of remaining friendships. Then n lines follow, each containing an integer o (-10000 <= o <= 10000) indicating how much each person owes (or is owed if o < 0). The sum of these values is zero. After this comes m lines giving the remaining friendships, each line containing two integers x, y (0 <= x < y <= n - 1) indicating that persons x and y are still friends. Output Your output should consist of a single line saying "POSSIBLE" or "IMPOSSIBLE". Sample Input 5 3 100 -75 -25 -42 42 0 1 1 2 3 4 4 2 15 20 -10 -25 0 2 1 3 Sample Output POSSIBLE IMPOSSIBLE

通过选择器的Google云端硬盘文件下载始终返回找不到的文件

<div class="post-text" itemprop="text"> <p>I've now spent hours making this work and I'm running out of documentation to read on how to get such a simple process to work correctly. Here's my ideal situation.</p> <p>I have a javascript version of the Google Drive picker (too me a couple hours to finally figured out the thing that I wanted google called the Google Picker API). Once I found it, it works like a charm and everything I ever hoped it would be. (kinda). What I need to have happen is the picker returns the file_id (which it does) and then I use that file ID in a php script to fetch the file through a wget call and then I save the file on my server. I haven't been able to get a curl request to work right so I used googles php library, which I'd rather not use, but whatever will make it work.</p> <p>My glaringly huge problem is I have tried through the javascript api and the php api and even google's own explorer api and I get a file not found error on any file I choose from the several different google drive accounts I've attempted. I've been able to fix the myriad of descriptive (or lack thereof) errors and I'm finally settling down to this one error I cannot get passed. The javascript api returns a error 400 "Required Value: id" even though I know the value is getting populated correctly. The php library returns an error 404: File Not Found</p> <p>I have Google Drive API enabled and running. I have Google Drive SDK enabled and appears to be working properly. I've read elsewhere that this could be a file permissions error, but I have no direction on how to correct this if it even is the problem.</p> <p>For the record, I also had to do a dropbox integration, and entire integration from start to finish was less than 30 minutes.</p> <h2>Edit</h2> <p>Just in case I'm missing something with my api keys (there are way too many), for the picker, I need to the following from the Google Cloud interface. The .setDeveloperKey which is the Browser Key API Key, the .setAppId is the Oauth 2.0 client id. </p> <p>When I setup the php library and am building up the client, $client-&gt;setClientId() is my Oauth 2.0 client id and $client-&gt;setDeveloperKey() is my Server Key API Key correct?</p> </div>

Money Matters 会的再来回答!

Problem Description Our sad tale begins with a tight clique of friends. Together they went on a trip to the picturesque country of Molvania. During their stay, various events which are too horrible to mention occurred. The net result was that the last evening of the trip ended with a momentous exchange of "I never want to see you again!"s. A quick calculation tells you it may have been said almost 50 million times! Back home in Scandinavia, our group of ex-friends realize that they haven't split the costs incurred during the trip evenly. Some people may be out several thousand crowns. Settling the debts turns out to be a bit more problematic than it ought to be, as many in the group no longer wish to speak to one another, and even less to give each other money. Naturally, you want to help out, so you ask each person to tell you how much money she owes or is owed, and whom she is still friends with. Given this information, you're sure you can gure out if it's possible for everyone to get even, and with money only being given between persons who are still friends. Input The first line contains two integers, n (2 <= n <= 10000), and m (0 <= m <= 50000), the number of friends and the number of remaining friendships. Then n lines follow, each containing an integer o (-10000 <= o <= 10000) indicating how much each person owes (or is owed if o < 0). The sum of these values is zero. After this comes m lines giving the remaining friendships, each line containing two integers x, y (0 <= x < y <= n - 1) indicating that persons x and y are still friends. Output Your output should consist of a single line saying "POSSIBLE" or "IMPOSSIBLE". Sample Input 5 3 100 -75 -25 -42 42 0 1 1 2 3 4 4 2 15 20 -10 -25 0 2 1 3 Sample Output POSSIBLE IMPOSSIBLE

PHP Paypal Auth / Capture NVP集成故障

<div class="post-text" itemprop="text"> <h2>Background:</h2> <p>We implemented Paypal Authorization and Capture flow using NVP integration and php-curl. <br>The complete process is described on the PayPal developer website : <a href="https://developer.paypal.com/webapps/developer/docs/classic/express-checkout/ht_ec-singleAuthPayment-curl-etc/" rel="nofollow noreferrer">https://developer.paypal.com/webapps/developer/docs/classic/express-checkout/ht_ec-singleAuthPayment-curl-etc/</a></p> <p>On our website, the current payment scenario is :<br> - First, an user click on a button to initiate a payment authorization, redirecting him on the PayPal website (SetExpressCheckout with paymentaction=Authorization)<br> - If the user succesfully confirmed the payment on the PayPal website, he is redirected to our website on a specific success page<br> - This "success page" gets a <strong>token</strong> and a <strong>PayerID</strong> from the PayPal website, we then call GetExpressCheckoutDetails to check the status and the amount of this authorization<br> - If everything is ok, we tell PayPal to confirm this authorization (DoExpressCheckoutPayment with paymentaction=Authorization) and we get an authorization ID to store into our database<br> - Later, someone else can settle the transaction by clicking on a button, using the authorization ID we stored (DoCapture) <br><br></p> <h2>Additional informations:</h2> <p>According to the PayPal documentation : </p> <blockquote> <p>PayPal honors 100% of authorized funds for three days <br> The accounts of buyers and merchants cannot be closed if there is a pending (unsettled) authorization<br> <a href="https://developer.paypal.com/docs/classic/paypal-payments-standard/integration-guide/authcapture/" rel="nofollow noreferrer">https://developer.paypal.com/docs/classic/paypal-payments-standard/integration-guide/authcapture/</a></p> </blockquote> <p>On our website, authorizations are automatically voided if they are not settled within 24 hours. (using crontab)<br> <br></p> <h2>The problem:</h2> <p>A problem occurs on the last part (when we call the "confirm" function) : When an user click on a "confirm" button, it seems that sometimes the curl request is taking time to get a transaction ID back from PayPal.<br> When this happens, the user usually close the webpage, PayPal confirm the authorization (and thus money transfert) but our website is not notified about this because the following code (from the "Source Code" section below) has not been executed or reached :</p> <pre><code>if ($transaction_id) { /* * [...] * Everything is ok, payment has been performed * so we do everything to give our user what he asked for */ } else { // Error : No transaction id } </code></pre> <p>Because the script stopped before getting the curl response.<br> Moreover, if we try to click on the button again, PayPal tells us that the authorization ID doesn't exist (because already performed).<br></p> <p>But sometimes everything works well without any problem or lag. <br><br></p> <h2>Source Code:</h2> <pre><code>/* * This is our main function, called when * we have to settle our transaction * when an user click on a "confirm" button **/ public function confirm($cart_id) { /* * [...] * We check lot of stuff to be sure this user * can perform this action */ // We get theses values from the database authorization_id = "lorem ipsum"; $amount = 10; // We tell PayPal to settle the transaction $transaction_id = $this-&gt;settle_transaction($authorization_id, $amount); if ($transaction_id) { /* * [...] * Everything is ok, payment has been performed * so we do everything to give our user what he asked for */ } else { // Error : No transaction id } } private function settle_transaction($authorization_id, $amount) { // Our credentials $params = array( "USER" =&gt; $this-&gt;paypal_user, "PWD" =&gt; $this-&gt;paypal_pwd, "SIGNATURE" =&gt; $this-&gt;paypal_signature, "VERSION" =&gt; 95 ); $params["METHOD"] = "DoCapture"; $params["AUTHORIZATIONID"] = $authorization_id; $params["AMT"] = $amount; $params["CURRENCYCODE"] = "EUR"; $params["COMPLETETYPE"] = "Complete"; $result = $this-&gt;curl($params); if ($result) { // We check that this PayPal request has been successful if ($result["ACK"] == "Success") { $transaction_id = $result["TRANSACTIONID"]; if ($result["PAYMENTSTATUS"] == "Completed") { return $transaction_id; } } } return NULL; } private function curl($params) { $ch = curl_init(); curl_setopt($ch, CURLOPT_URL, $this-&gt;paypal_endpoint); curl_setopt($ch, CURLOPT_POST, count($params)); curl_setopt($ch, CURLOPT_POSTFIELDS, http_build_query($params)); curl_setopt($ch, CURLOPT_RETURNTRANSFER, TRUE); parse_str(curl_exec($ch), $result); curl_close($ch); return $result; } </code></pre> <p>Do you have any idea to resolve this issue ?<br> I was thinking about settling transaction at the end of the script because PayPal honors 100% of authorized funds for three days, and I only need them to be hold for 1 day but I'm not sure of this anyway ... <br></p> <h2>Edit 1:</h2> <p>My apache2 error.log reported this when this problem happens :</p> <pre><code>[Mon Aug 08 20:42:55.959330 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:42:56.960453 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:42:57.961188 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:42:58.962230 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:42:59.963297 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:00.964384 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:01.965476 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:02.966478 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:03.967595 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:04.968713 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:05.969783 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:06.970877 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:07.972002 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:08.972749 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:09.973847 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:10.974926 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:11.976080 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:12.977168 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:13.978244 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:14.979320 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:15.980414 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:16.981493 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:17.982578 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:18.983673 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:19.984762 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:20.985841 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:21.986650 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:22.987725 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:23.988826 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:24.989939 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:25.991061 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:26.992181 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:27.993305 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:28.994422 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:29.995556 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:30.996661 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:31.997774 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:32.998905 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:34.000089 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:35.001202 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:36.002326 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:37.003424 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:38.004551 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:39.005677 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:40.006799 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:41.007902 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:42.009021 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:43.010132 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:44.011245 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:45.012361 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:46.013479 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:47.014577 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:48.015685 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:49.016801 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:50.017906 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:51.018980 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:52.020049 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:53.021158 2016] [mpm_event:error] [pid 141:tid 3779940374400] AH00485: scoreboard is full, not at MaxRequestWorkers [Mon Aug 08 20:43:53.391316 2016] [:error] [pid 980:tid 3779386513152] (104)Connection reset by peer: [client MY-IP:55236] FastCGI: failed to read from backend server, referer: http://#### [Mon Aug 08 21:18:04.748237 2016] [:error] [pid 1287:tid 3779782977280] (104)Connection reset by peer: [client MY-IP:37196] FastCGI: failed to read from backend server </code></pre> <h2>Edit 2:</h2> <p>I found <a href="https://stackoverflow.com/questions/38804016/paypal-rest-sandbox-api-giving-internal-service-error">this topic</a> that seems to have a similar issue :</p> <blockquote> <p>What is particularly strange is that the payment has been processed correctly.</p> </blockquote> <p>And right now I can't seem to be able to reproduce this bug.<br> Do you think it could have been a PayPal issue or something like this ?<br> Even if it was, I wan't to make sure that this problem won't happen again, but how can I test if I can't reproduce this ?</p> </div>

viewpager里面广告轮播代码报错

![图片说明](https://img-ask.csdn.net/upload/201606/15/1465953831_651734.png) 子界面广告轮播代码 private int[] images = { R.drawable.lunbo_shouye1, R.drawable.lunbo_shouye2, R.drawable.lunbo_shouye3,R.drawable.lunbo_shouye4, R.drawable.lunbo_shouye5}; private List<ImageView> imageViews = new ArrayList<ImageView>(); private List<ImageView> pointIVs = new ArrayList<ImageView>(); private TopAdapter adapter; private int currentPos = 0; private Handler handlerTop = new Handler() { public void handleMessage(android.os.Message msg) { switch (msg.what) { case 1: int currentItem = vp.getCurrentItem(); vp.setCurrentItem(currentItem + 1,true); //发送延迟3s消息再次滑动到下一页 handlerTop.sendEmptyMessageDelayed(1, 3000); break; } super.handleMessage(msg); } }; public void lunbo() { //创建用于显示点图标的布局参数对象 LinearLayout.LayoutParams params = new LinearLayout.LayoutParams( LinearLayout.LayoutParams.WRAP_CONTENT, LinearLayout.LayoutParams.WRAP_CONTENT); params.leftMargin = 5; params.rightMargin = 5; for (int i = 0; i < images.length; i++) { //创建将要显示到ViewPager中的ImageView对象 ImageView imageView = new ImageView(this.activity); imageView.setBackgroundResource(images[i]); //将下标保存到imageView的tag imageView.setTag(i); //设置imageView点击监听 imageView.setOnClickListener(new View.OnClickListener() { @Override public void onClick(View v) { } }); //保存到list中 imageViews.add(imageView); //创建用于显示指示点图片的ImageView对象 ImageView pointIV = new ImageView(this.activity); //设置多状态背景图片 pointIV.setBackgroundResource(R.drawable.point_selector); //让第一个初始显示为当前点图片, 其它显示为一般的点图片 if (i == 0) { pointIV.setEnabled(true); } else { pointIV.setEnabled(false); } //用集合保存 pointIVs.add(pointIV); //添加到RadioGroup中显示 ll.addView(pointIV, params); } //创建adapter对象 adapter = new TopAdapter(activity,imageViews); //设置adapter显示ViewPager vp.setAdapter(adapter); if(handlerTop != null){ //移除之前未处理的消息 handlerTop.removeCallbacksAndMessages(null); } //计算ViewPager中当前Page的下标 int currentItem = Integer.MAX_VALUE / 2 - Integer.MAX_VALUE / 2 % images.length; //初始显示到当前page vp.setCurrentItem(currentItem); //设置ViewPager页面改变的监听 vp.setOnPageChangeListener(new ViewPager.OnPageChangeListener() { // 当当前page有变化时回调 // 1. 更新圆点图标 // 2. 更新当前文本 @Override public void onPageScrolled(int position, float positionOffset, int positionOffsetPixels) { } @Override public void onPageSelected(int position) { //1. 更新圆点图标 pointIVs.get(currentPos).setEnabled(false); position = position % pointIVs.size(); pointIVs.get(position).setEnabled(true); currentPos = position; } @Override public void onPageScrollStateChanged(int state) { if (state == ViewPager.SCROLL_STATE_DRAGGING) { handlerTop.removeMessages(1); } else if (state == ViewPager.SCROLL_STATE_IDLE) { handlerTop.sendEmptyMessageDelayed(1, 3000); } else if (state == ViewPager.SCROLL_STATE_SETTLING) { handlerTop.removeMessages(1); } } }); handlerTop.sendEmptyMessageDelayed(1, 3000); } public class TopAdapter extends PagerAdapter{ private Context context; private List<ImageView> imageViews; public TopAdapter(Context context,List<ImageView> imageViews){ this.context = context; this.imageViews = imageViews; } @Override public Object instantiateItem(ViewGroup container, int position) { position = position % images.length; ImageView imageView = imageViews.get(position); container.addView(imageView); //图片的点击事件 imageView.setOnClickListener(new View.OnClickListener() { @Override public void onClick(View v) { Intent intent = new Intent(context, XiangQingActivity.class); context.startActivity(intent); } }); return imageView; } @Override public int getCount() { return Integer.MAX_VALUE; } @Override public boolean isViewFromObject(View view, Object object) { return view == object; } @Override public void destroyItem(ViewGroup container1, int position, Object object) { // ((ViewGroup) container.getParent()).removeView((View) object); container1.removeView((View) object); } }

在中国程序员是青春饭吗?

今年,我也32了 ,为了不给大家误导,咨询了猎头、圈内好友,以及年过35岁的几位老程序员……舍了老脸去揭人家伤疤……希望能给大家以帮助,记得帮我点赞哦。 目录: 你以为的人生 一次又一次的伤害 猎头界的真相 如何应对互联网行业的「中年危机」 一、你以为的人生 刚入行时,拿着傲人的工资,想着好好干,以为我们的人生是这样的: 等真到了那一天,你会发现,你的人生很可能是这样的: ...

程序员请照顾好自己,周末病魔差点一套带走我。

程序员在一个周末的时间,得了重病,差点当场去世,还好及时挽救回来了。

和黑客斗争的 6 天!

互联网公司工作,很难避免不和黑客们打交道,我呆过的两家互联网公司,几乎每月每天每分钟都有黑客在公司网站上扫描。有的是寻找 Sql 注入的缺口,有的是寻找线上服务器可能存在的漏洞,大部分都...

点沙成金:英特尔芯片制造全过程揭密

“亚马逊丛林里的蝴蝶扇动几下翅膀就可能引起两周后美国德州的一次飓风……” 这句人人皆知的话最初用来描述非线性系统中微小参数的变化所引起的系统极大变化。 而在更长的时间尺度内,我们所生活的这个世界就是这样一个异常复杂的非线性系统…… 水泥、穹顶、透视——关于时间与技艺的蝴蝶效应 公元前3000年,古埃及人将尼罗河中挖出的泥浆与纳特龙盐湖中的矿物盐混合,再掺入煅烧石灰石制成的石灰,由此得来了人...

上班一个月,后悔当初着急入职的选择了

最近有个老铁,告诉我说,上班一个月,后悔当初着急入职现在公司了。他之前在美图做手机研发,今年美图那边今年也有一波组织优化调整,他是其中一个,在协商离职后,当时捉急找工作上班,因为有房贷供着,不能没有收入来源。所以匆忙选了一家公司,实际上是一个大型外包公司,主要派遣给其他手机厂商做外包项目。**当时承诺待遇还不错,所以就立马入职去上班了。但是后面入职后,发现薪酬待遇这块并不是HR所说那样,那个HR自...

女程序员,为什么比男程序员少???

昨天看到一档综艺节目,讨论了两个话题:(1)中国学生的数学成绩,平均下来看,会比国外好?为什么?(2)男生的数学成绩,平均下来看,会比女生好?为什么?同时,我又联想到了一个技术圈经常讨...

副业收入是我做程序媛的3倍,工作外的B面人生是怎样的?

提到“程序员”,多数人脑海里首先想到的大约是:为人木讷、薪水超高、工作枯燥…… 然而,当离开工作岗位,撕去层层标签,脱下“程序员”这身外套,有的人生动又有趣,马上展现出了完全不同的A/B面人生! 不论是简单的爱好,还是正经的副业,他们都干得同样出色。偶尔,还能和程序员的特质结合,产生奇妙的“化学反应”。 @Charlotte:平日素颜示人,周末美妆博主 大家都以为程序媛也个个不修边幅,但我们也许...

如果你是老板,你会不会踢了这样的员工?

有个好朋友ZS,是技术总监,昨天问我:“有一个老下属,跟了我很多年,做事勤勤恳恳,主动性也很好。但随着公司的发展,他的进步速度,跟不上团队的步伐了,有点...

我入职阿里后,才知道原来简历这么写

私下里,有不少读者问我:“二哥,如何才能写出一份专业的技术简历呢?我总感觉自己写的简历太烂了,所以投了无数份,都石沉大海了。”说实话,我自己好多年没有写过简历了,但我认识的一个同行,他在阿里,给我说了一些他当年写简历的方法论,我感觉太牛逼了,实在是忍不住,就分享了出来,希望能够帮助到你。 01、简历的本质 作为简历的撰写者,你必须要搞清楚一点,简历的本质是什么,它就是为了来销售你的价值主张的。往深...

外包程序员的幸福生活

今天给你们讲述一个外包程序员的幸福生活。男主是Z哥,不是在外包公司上班的那种,是一名自由职业者,接外包项目自己干。接下来讲的都是真人真事。 先给大家介绍一下男主,Z哥,老程序员,是我十多年前的老同事,技术大牛,当过CTO,也创过业。因为我俩都爱好喝酒、踢球,再加上住的距离不算远,所以一直也断断续续的联系着,我对Z哥的状况也有大概了解。 Z哥几年前创业失败,后来他开始干起了外包,利用自己的技术能...

C++11:一些微小的变化(新的数据类型、template表达式内的空格、nullptr、std::nullptr_t)

本文介绍一些C++的两个新特性,它们虽然微小,但对你的编程十分重要 一、Template表达式内的空格 C++11标准之前建议在“在两个template表达式的闭符之间放一个空格”的要求已经过时了 例如: vector&lt;list&lt;int&gt; &gt;; //C++11之前 vector&lt;list&lt;int&gt;&gt;; //C++11 二、nullptr ...

优雅的替换if-else语句

场景 日常开发,if-else语句写的不少吧??当逻辑分支非常多的时候,if-else套了一层又一层,虽然业务功能倒是实现了,但是看起来是真的很不优雅,尤其是对于我这种有强迫症的程序"猿",看到这么多if-else,脑袋瓜子就嗡嗡的,总想着解锁新姿势:干掉过多的if-else!!!本文将介绍三板斧手段: 优先判断条件,条件不满足的,逻辑及时中断返回; 采用策略模式+工厂模式; 结合注解,锦...

深入剖析Springboot启动原理的底层源码,再也不怕面试官问了!

大家现在应该都对Springboot很熟悉,但是你对他的启动原理了解吗?

离职半年了,老东家又发 offer,回不回?

有小伙伴问松哥这个问题,他在上海某公司,在离职了几个月后,前公司的领导联系到他,希望他能够返聘回去,他很纠结要不要回去? 俗话说好马不吃回头草,但是这个小伙伴既然感到纠结了,我觉得至少说明了两个问题:1.曾经的公司还不错;2.现在的日子也不是很如意。否则应该就不会纠结了。 老实说,松哥之前也有过类似的经历,今天就来和小伙伴们聊聊回头草到底吃不吃。 首先一个基本观点,就是离职了也没必要和老东家弄的苦...

为什么你不想学习?只想玩?人是如何一步一步废掉的

不知道是不是只有我这样子,还是你们也有过类似的经历。 上学的时候总有很多光辉历史,学年名列前茅,或者单科目大佬,但是虽然慢慢地长大了,你开始懈怠了,开始废掉了。。。 什么?你说不知道具体的情况是怎么样的? 我来告诉你: 你常常潜意识里或者心理觉得,自己真正的生活或者奋斗还没有开始。总是幻想着自己还拥有大把时间,还有无限的可能,自己还能逆风翻盘,只不是自己还没开始罢了,自己以后肯定会变得特别厉害...

为什么程序员做外包会被瞧不起?

二哥,有个事想询问下您的意见,您觉得应届生值得去外包吗?公司虽然挺大的,中xx,但待遇感觉挺低,马上要报到,挺纠结的。

当HR压你价,说你只值7K,你该怎么回答?

当HR压你价,说你只值7K时,你可以流畅地回答,记住,是流畅,不能犹豫。 礼貌地说:“7K是吗?了解了。嗯~其实我对贵司的面试官印象很好。只不过,现在我的手头上已经有一份11K的offer。来面试,主要也是自己对贵司挺有兴趣的,所以过来看看……”(未完) 这段话主要是陪HR互诈的同时,从公司兴趣,公司职员印象上,都给予对方正面的肯定,既能提升HR的好感度,又能让谈判气氛融洽,为后面的发挥留足空间。...

面试:第十六章:Java中级开发(16k)

HashMap底层实现原理,红黑树,B+树,B树的结构原理 Spring的AOP和IOC是什么?它们常见的使用场景有哪些?Spring事务,事务的属性,传播行为,数据库隔离级别 Spring和SpringMVC,MyBatis以及SpringBoot的注解分别有哪些?SpringMVC的工作原理,SpringBoot框架的优点,MyBatis框架的优点 SpringCould组件有哪些,他们...

面试阿里p7,被按在地上摩擦,鬼知道我经历了什么?

面试阿里p7被问到的问题(当时我只知道第一个):@Conditional是做什么的?@Conditional多个条件是什么逻辑关系?条件判断在什么时候执...

面试了一个 31 岁程序员,让我有所触动,30岁以上的程序员该何去何从?

最近面试了一个31岁8年经验的程序猿,让我有点感慨,大龄程序猿该何去何从。

【阿里P6面经】二本,curd两年,疯狂复习,拿下阿里offer

二本的读者,在老东家不断学习,最后逆袭

大三实习生,字节跳动面经分享,已拿Offer

说实话,自己的算法,我一个不会,太难了吧

程序员垃圾简历长什么样?

已经连续五年参加大厂校招、社招的技术面试工作,简历看的不下于万份 这篇文章会用实例告诉你,什么是差的程序员简历! 疫情快要结束了,各个公司也都开始春招了,作为即将红遍大江南北的新晋UP主,那当然要为小伙伴们做点事(手动狗头)。 就在公众号里公开征简历,义务帮大家看,并一一点评。《启舰:春招在即,义务帮大家看看简历吧》 一石激起千层浪,三天收到两百多封简历。 花光了两个星期的所有空闲时...

《经典算法案例》01-08:如何使用质数设计扫雷(Minesweeper)游戏

我们都玩过Windows操作系统中的经典游戏扫雷(Minesweeper),如果把质数当作一颗雷,那么,表格中红色的数字哪些是雷(质数)?您能找出多少个呢?文中用列表的方式罗列了10000以内的自然数、质数(素数),6的倍数等,方便大家观察质数的分布规律及特性,以便对算法求解有指导意义。另外,判断质数是初学算法,理解算法重要性的一个非常好的案例。

《Oracle Java SE编程自学与面试指南》最佳学习路线图(2020最新版)

正确选择比瞎努力更重要!

面试官:你连SSO都不懂,就别来面试了

大厂竟然要考我SSO,卧槽。

微软为一人收购一公司?破解索尼程序、写黑客小说,看他彪悍的程序人生!...

作者 | 伍杏玲出品 | CSDN(ID:CSDNnews)格子衬衫、常掉发、双肩包、修电脑、加班多……这些似乎成了大众给程序员的固定标签。近几年流行的“跨界风”开始刷新人们对程序员的...

终于,月薪过5万了!

来看几个问题想不想月薪超过5万?想不想进入公司架构组?想不想成为项目组的负责人?想不想成为spring的高手,超越99%的对手?那么本文内容是你必须要掌握的。本文主要详解bean的生命...

我说我懂多线程,面试官立马给我发了offer

不小心拿了几个offer,有点烦

自从喜欢上了B站这12个UP主,我越来越觉得自己是个废柴了!

不怕告诉你,我自从喜欢上了这12个UP主,哔哩哔哩成为了我手机上最耗电的软件,几乎每天都会看,可是吧,看的越多,我就越觉得自己是个废柴,唉,老天不公啊,不信你看看…… 间接性踌躇满志,持续性混吃等死,都是因为你们……但是,自己的学习力在慢慢变强,这是不容忽视的,推荐给你们! 都说B站是个宝,可是有人不会挖啊,没事,今天咱挖好的送你一箩筐,首先啊,我在B站上最喜欢看这个家伙的视频了,为啥 ,咱撇...

代码注释如此沙雕,会玩还是你们程序员!

某站后端代码被“开源”,同时刷遍全网的,还有代码里的那些神注释。 我们这才知道,原来程序员个个都是段子手;这么多年来,我们也走过了他们的无数套路… 首先,产品经理,是永远永远吐槽不完的!网友的评论也非常扎心,说看这些代码就像在阅读程序员的日记,每一页都写满了对产品经理的恨。 然后,也要发出直击灵魂的质问:你是尊贵的付费大会员吗? 这不禁让人想起之前某音乐app的穷逼Vip,果然,穷逼在哪里都是...

2020春招面试了10多家大厂,我把问烂了的数据库事务知识点总结了一下

2020年截止目前,我面试了阿里巴巴、腾讯、美团、拼多多、京东、快手等互联网大厂。我发现数据库事务在面试中出现的次数非常多。

程序员如何与产品经理优雅的干架

早前,平安产险科技一名外包程序员和一名外包产品经理干架的视频几乎在互联网圈都传遍了,因为产品提了一个需求:要求用户App的主题颜色能根据手机壳自动调整。 首先说这个需求对于应用开发工程师来说,确实是有点奇葩,当然并非不能实现。这块涉及图形图像处理,用机器学习和人工智能来提取图像颜色,这是基本图像识别过程,对于采集图像,可以提示对着镜子自拍一张,上传图片,通过大量的训练数据,来识别手机体颜色。当然并...

爬虫(101)爬点重口味的

小弟最近在学校无聊的很哪,浏览网页突然看到一张图片,都快流鼻血。。。然后小弟冥思苦想,得干一点有趣的事情python 爬虫库安装https://s.taobao.com/api?_ks...

在拼多多上班,是一种什么样的体验?我心态崩了呀!

之前有很多读者咨询我:武哥,在拼多多上班是一种什么样的体验?由于一直很忙,没抽出时间来和大家分享。上周末特地花点时间来写了一篇文章,跟大家分享一下拼多多的日常。 1. 倒时差的作息 可能很多小伙伴都听说了,拼多多加班很严重。这怎么说呢?作息上确实和其他公司有点区别,大家知道 996,那么自然也就能理解拼多多的“11 11 6”了。 所以当很多小伙伴早上出门时,他们是这样的: 我们是这样的: 当...

应聘3万的职位,有必要这么刁难我么。。。沙雕。。。

又一次被面试官带到坑里面了。面试官:springmvc用过么?我:用过啊,经常用呢面试官:springmvc中为什么需要用父子容器?我:嗯。。。没听明白你说的什么。面试官:就是contr...

立即提问
相关内容推荐