JAVA使用robot类进行编写线程,如何正确的终止(其中会使用到ROBOT.DEALY())

在进行学习时,发现自己用robot类写鼠标点击事件的循环,然后以线程的方式进行运行,但是如果想要正确的终止,一般应该使用interrupt,但是如果在main函数中对这个线程进行interrupt,会抛出无法捕获的interruptexception(因为里面并没有使用sleep方法),while循环进行判断时可能是robot报错之后会将interrupt标志位重置,导致死循环,求解决或说明
代码如下

public class Click_Thread implements Runnable {
public void run()
{
try {
Robot robot = new Robot();

        while(!Thread.currentThread().isInterrupted())
        {
            movemouse(robot, 1421,456);
            pressmouseleft(robot);
            robot.delay(1000);
            movemouse(robot, 1000, 494);
            pressmouseleft(robot);
            robot.delay(1000);
            movemouse(robot, 1166, 635);
            pressmouseleft(robot);
            robot.delay(1000);

        }

    } catch (Exception e) {
        // TODO Auto-generated catch block
        System.out.println("捕获异常");
        e.printStackTrace();
    }
    System.out.println("????");

}
private static void movemouse(Robot robot,int x,int y)
{
    robot.mouseMove(x,y);
    robot.delay(500);
}
private static void pressmouseleft(Robot robot)
{
    robot.mousePress(InputEvent.BUTTON1_MASK);
    robot.delay(10);
    robot.mouseRelease(InputEvent.BUTTON1_MASK);
    robot.delay(500);
}

这个是那个线程类,然后用一个主函数启动

1个回答

算了,自己结贴,用interrupt确实不好实现,我最后采用了判断线程名的方式进行运行并中断处理

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

前一天还好的,第二天发现 只运行到以一个move,打开了其他软件的界面,然后鼠标就不动了,我手动点回Eclipse界面,鼠标又开始继续执行了 ``` robot = new Robot(); //点开了另一个软件然后鼠标就一直停留在这 robot.mouseMove(513, 1060); robot.delay(500); robot.mousePress(KeyEvent.BUTTON1_DOWN_MASK); robot.mouseRelease(KeyEvent.BUTTON1_DOWN_MASK); robot.delay(500); -----到这里鼠标就不会移动了 robot.mouseMove(972, 35); robot.delay(500); robot.mousePress(KeyEvent.BUTTON1_DOWN_MASK); robot.mouseRelease(KeyEvent.BUTTON1_DOWN_MASK); robot.delay(500); ``` 然后我在第二个move下加了个输出,发现已经执行了,但鼠标位置没变 后来试了下,在MyEclipse界面能够正常移动,切换到其他界面就出现上述情况

Java Robot如何实现模拟shift+home的组合键

因为业务需要通过java模拟键盘的组合键操作,通过Robot类来实现。遇到一个麻烦的问题,就是SHIFT+HOME的组合实现不了。 代码很简单,没有什么技巧,见下: ``` Robot robot = new Robot(); robot.keyPress(KeyEvent.VK_SHIFT); robot.keyPress(KeyEvent.VK_HOME); robot.keyRelease(KeyEvent.VK_HOME); robot.keyRelease(KeyEvent.VK_SHIFT); ``` 通过验证,shift和home的模拟都实现了,就是没有组合的效果,请大家指教下

JAVA robot模拟键盘失效

我用程序模拟锁屏无效啊WIN+L,但是WIN+R,,,,WIN+Q都能用,就是模拟WIN+L无效,求解决 Robot robot = new Robot(); robot.keyPress(KeyEvent.VK_WINDOWS); robot.keyPress(KeyEvent.VK_L); robot.keyRelease(KeyEvent.VK_WINDOWS); robot.keyRelease(KeyEvent.VK_L);

java Robot 如何在方法内重用robot对象

Robot的方法并不能直接引用 ``` public void 单击(int x,int y){ try { Robot.mouseMove(x,y); Robot.mousePress(InputEvent.BUTTON1_DOWN_MASK);//按下右键 Robot.mouseRelease(InputEvent.BUTTON1_DOWN_MASK);//释放右键 } catch (Exception e) { // TODO Auto-generated catch block e.printStackTrace(); } } ``` 以上蹦出Cannot make a static reference to the non-static错误 也就是用robot方法必须先new个对象 而且是在方法体内new 可我想写很多方法,比如单击啊,移动鼠标,什么的而且使用频率很高,如果在方法体内new对象就会每做一个动作就新建一个robot对象,感觉会浪费很多性能 还有一种方法就是在参数那里加个robot对象的口 ``` public void 单击(Robot robot,int x,int y){ robot.mouseMove(x,y); robot.mousePress(InputEvent.BUTTON1_DOWN_MASK);//按下右键 robot.mouseRelease(InputEvent.BUTTON1_DOWN_MASK);//释放右键 } ``` 可我觉得这种方法比较取巧...很不好 有什么其他方法可以避免这种情况的吗

有大神知道用robot framework怎么测试java应用程序吗?

我要用RIDE这个工具写测试用例,去测用eclipse运行的java swing写的一个简单的登录界面,这个测试工具我是新接触的,官网文档看的不是很懂,所以求教大家,知道的拜托大家回复好吗?

Special Robot的程序的编写思路

Problem Description Bob invented a special kind of robot controlled by a remote controller. The interesting thing is that the robot can only move in a 2-dimentional plane which is vertical to the ground. Now we assume the vertical plane can be shown in Figure 1. Now Bob wants to conduct a performance for his robot. The situation can be described as follows: n balloons stay still on the ground; all of these balloons have an initial position whose Y-coordinates are 0. Each balloon will move up at certain time. The initial position of the robot is at (0, 0) and if the robot is at position (x, y) at time t, then it can only move to position (x, y-1) or position (x+1, y+1) in a unit time (the robot con not stay still at a position). Its task is to collect as more balloons as possible when it gets to the destination (K,0). When the robot is moving on the plane, balloons are continuously rising on its path from the ground. Each balloon can reach a unit height in a unit time. When the robot meets a balloon, it collects the balloon. The situation can be described as the following three examples which are shown in Figure 2: Example 1: At time t, the robot is at position (x, y), and a balloon is at position (x, y-2). The robot moves down and the balloon moves up; then at time t+1, the robot and the balloon meet at position (x, y-1), so the balloon can be collected by the robot ( which is shown in Figure 2(a)). Example 2: At time t, there is a balloon at position (x, y-1) and the robot stands at position (x, y). Because the balloon always moves up and the robot can move down, so the robot can collect this balloon because they will meet at some point between position (x, y-1) and (x, y) during their movement (which is shown in Figure 2(b)). Example 3: At time t, a balloon is at position (x+1, y) and the robot is at position (x, y). Because the robot can arrive at position (x+1, y+1) while the balloon can move up to the same position, the robot could collect the balloon at time t+1 (which is shown in Figure 2(c)). Maybe it is too easy a problem to control one robot, so Bob intends to control two robots simultaneously. You need to help him to calculate the maximum balloons these two robots can collect when they get to the destination. It is possible that the two robots get to the same position at the same time. Note that one balloon could not be collected by two robots and the balloons staying on the ground could not be collected either. Robot should not move to the underground (y < 0). Input The input contains several cases. For each case, the first line gives the value of n (0 ≤ n ≤ 10,000) and K (1 ≤ K ≤ 100) followed by n lines in which each contains two integers x (1 ≤ x ≤ K) and t (0 ≤ t ≤ 1000). The first integer indicates the position of a balloon and the other indicates the beginning time for it to rise. In the value of n and K, n is the number of balloons and K is the x-coordinate of the destination. The input is ended by two zeros. Output For each case, output the maximum balloons the two robots can collect. Sample Input 3 2 1 1 1 1 1 2 7 4 2 0 2 3 3 4 3 0 3 2 4 0 1 1 0 0 Sample Output 2 6

java如何判断使用代理

java如何判断用户是否使用了代理,我见不管是否使用代理,获取到的网络ip地址都是一样的,或者请问如何获取到代理服务器上的ip地址,我可以进行比较一下。

java robot控制鼠标键盘

public class Main { /** * @param args * @throws FileNotFoundException * @throws AWTException */ public static void main(String[] args) throws FileNotFoundException, AWTException { Robot robot; robot = new Robot(); while(true) { robot.delay(3000); robot.keyPress(KeyEvent.VK_V); robot.keyRelease(KeyEvent.VK_V); robot.keyPress(KeyEvent.VK_ENTER); robot.keyRelease(KeyEvent.VK_ENTER); } } } 将这段小代码搭成jar包,后我远程登录一台没有显示器的电脑,把jar包拷到这台没有显示器的电脑上,运行jar,并将鼠标焦点指到文本文件上,想每隔3秒输入一个v,一个回车。 我远程登录的时候,能正确运行,但是我退出登录,jar包程序还会运行,但是没有输出了。 robot控制鼠标键盘必须在有显示器的电脑上才能运行吗?

Robot Navigation 编写思路

Problem Description A robot has been sent to explore a remote planet. To specify a path the robot should take, a program is sent each day. The program consists of a sequence of the following commands: FORWARD X: move forward by X units. TURN LEFT: turn left (in place) by 90 degrees. TURN RIGHT: turn right (in place) by 90 degrees. The robot also has sensor units which allow it to obtain a map of its surrounding area. The map is represented as a grid. Some grid points contain hazards (e.g. craters) and the program must avoid these points or risk losing the robot. Naturally, if the initial location of the robot, the direction it is facing, and its destination position are known, it is best to send the shortest program (one consisting of the fewest commands) to move the robot to its destination (we do not care which direction it faces at the destination). You are more interested in knowing the number of different shortest programs that can move the robot to its destination. However, the number of shortest programs can be very large, so you are satisfied to compute the number as a remainder modulo 1,000,000. Input There will be several test cases in the input. Each test case will begin with a line with two integers N M Where N is the number of rows in the grid, and M is the number of columns in the grid (2 ≤ N, M ≤ 100). The next N lines of input will have M characters each. The characters will be one of the following: ‘.’ Indicating a navigable grid point. ‘*’ Indicating a crater (i.e. a non-navigable grid point). ‘X’ Indicating the target grid point. There will be exactly one ‘X’. ‘N’, ‘E’, ‘S’, or ‘W’ Indicating the starting point and initial heading of the robot. There will be exactly one of these. Note that the directions mirror compass directions on a map: N is North (toward the top of the grid), E is East (toward the right of the grid), S is South (toward the bottom of the grid) and W is West (toward the left of the grid). There will be no spaces and no other characters in the description of the map. The input will end with a line with two 0s. Output For each test case, output two integers on a single line, with a single space between them. The first is the length of a shortest possible program to navigate the robot from its starting point to the target, and the second is the number of different programs of that length which will get the robot to the target (modulo 1,000,000). If there is no path from the robot to the target, output two zeros separated by a single space. Output no extra spaces, and do not separate answers with blank lines. Sample Input 5 6 *....X .....* .....* .....* N....* 6 5 ....X .**** .**** .**** .**** N**** 3 3 .E. *** .X. 0 0 Sample Output 6 4 3 1 0 0

Robot Motion 程序的编写的过程

Problem Description A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are N north (up the page) S south (down the page) E east (to the right on the page) W west (to the left on the page) For example, suppose the robot starts on the north (top) side of Grid 1 and starts south (down). The path the robot follows is shown. The robot goes through 10 instructions in the grid before leaving the grid. Compare what happens in Grid 2: the robot goes through 3 instructions only once, and then starts a loop through 8 instructions, and never exits. You are to write a program that determines how long it takes a robot to get out of the grid or how the robot loops around. Input There will be one or more grids for robots to navigate. The data for each is in the following form. On the first line are three integers separated by blanks: the number of rows in the grid, the number of columns in the grid, and the number of the column in which the robot enters from the north. The possible entry columns are numbered starting with one at the left. Then come the rows of the direction instructions. Each grid will have at least one and at most 10 rows and columns of instructions. The lines of instructions contain only the characters N, S, E, or W with no blanks. The end of input is indicated by a row containing 0 0 0. Output For each grid in the input there is one line of output. Either the robot follows a certain number of instructions and exits the grid on any one the four sides or else the robot follows the instructions on a certain number of locations once, and then the instructions on some number of locations repeatedly. The sample input below corresponds to the two grids above and illustrates the two forms of output. The word "step" is always immediately followed by "(s)" whether or not the number before it is 1. Sample Input 3 6 5 NEESWE WWWESS SNWWWW 4 5 1 SESWE EESNW NWEEN EWSEN 0 0 Sample Output 10 step(s) to exit 3 step(s) before a loop of 8 step(s)

JAVA robot截图后怎么通过socket传送给android显示在ImageView

我今天找了一天没找到啊!网上方法都试过了。。 ``` public Bitmap getScreenshot(){ if(input!=null) { try { int size = input.readInt(); byte[] data = new byte[size]; int len = 0; while (len < size) { len += input.read(data, len, size - len); } ByteArrayOutputStream outPut = new ByteArrayOutputStream(); bmp = BitmapFactory.decodeByteArray(data, 0, data.length); bmp.compress(Bitmap.CompressFormat.PNG, 100, outPut); Log.d("截图", "getScreenshot: "); return bmp; } catch (IOException e) { Log.e("截图", "getScreenshot: " + e.toString(), e); return null; } } return null; } ``` Log.d("截图", "getScreenshot: ");这句怎么也执行不到。。

Writing Robot的代码的编写

Problem Description Word's combination is an interesting thing. Given a set of words S={s1, s2, ..., sn}, where si is a word only consists lowercase letter and its length is less than 50. When si merges in a text, its effect on reader's mood is both positive and negative. A word's positive effect is measured in love level li and negative effect is in hate level hi. At the same time, given a set paragraph P={P1, P2, ..., Pn} and Pj is a string whose length is less than 1000. For each word si in S, there is two conditions in Pj as follows: Related : si is a substring of Pj, and li units of love level is added to Pj, if si occurs several times in Pj, every occurrence is counted. Unrelated : si never occurs in Pj and this condition bring Pj nothing. Text T is defined as a subset of P. T's love level is defined as sum of Pj's love level where Pj belongs to T minus words?hate level. Because a strange psychology phenomenon, hate level of a word which occurs in T is only counted once no matter how many times it occurs. Given the set of S and P, writing robot's job is to select a subset T to maximum the love level. Input The first line of the input contains a single integer T (1 ≤ T ≤ 15), the number of test cases. Then T cases follow. First line of each case contains 2 integers, S, P. (1≤S, P≤150), then S lines follows, each line contains 2 integers, li, hi, (1≤li≤100, 1≤hi≤1000), and a string si with length less than 50. Next P lines, each contains a string Pi with length less than 1000. It guarantees that the answer will not exceed 32-bit signed integer. Output For the x-th test case, print "Case x: " and maximum T's profit in a line. Sample Input 2 3 2 2 2 hit 1 2 it 3 1 song hitman singasong 2 2 2 3 ab 1 6 ba ababab bababa Sample Output Case 1: 2 Case 2: 6

Robot Motion 编写和解决

Problem Description A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are N north (up the page) S south (down the page) E east (to the right on the page) W west (to the left on the page) For example, suppose the robot starts on the north (top) side of Grid 1 and starts south (down). The path the robot follows is shown. The robot goes through 10 instructions in the grid before leaving the grid. Compare what happens in Grid 2: the robot goes through 3 instructions only once, and then starts a loop through 8 instructions, and never exits. You are to write a program that determines how long it takes a robot to get out of the grid or how the robot loops around. Input There will be one or more grids for robots to navigate. The data for each is in the following form. On the first line are three integers separated by blanks: the number of rows in the grid, the number of columns in the grid, and the number of the column in which the robot enters from the north. The possible entry columns are numbered starting with one at the left. Then come the rows of the direction instructions. Each grid will have at least one and at most 10 rows and columns of instructions. The lines of instructions contain only the characters N, S, E, or W with no blanks. The end of input is indicated by a row containing 0 0 0. Output For each grid in the input there is one line of output. Either the robot follows a certain number of instructions and exits the grid on any one the four sides or else the robot follows the instructions on a certain number of locations once, and then the instructions on some number of locations repeatedly. The sample input below corresponds to the two grids above and illustrates the two forms of output. The word "step" is always immediately followed by "(s)" whether or not the number before it is 1. Sample Input 3 6 5 NEESWE WWWESS SNWWWW 4 5 1 SESWE EESNW NWEEN EWSEN 0 0 Sample Output 10 step(s) to exit 3 step(s) before a loop of 8 step(s)

想用java写个录制软件,但是鼠标一直闪,画面没鼠标,求救!!!

代码如下 ``` package image; import java.awt.AWTException; import java.awt.Rectangle; import java.awt.image.BufferedImage; import java.io.IOException; //开始 public class ImageDistinguish { public static void main(String[] args) throws IOException, AWTException { Paint p = new Paint(); p.show(); } //返回屏幕的流 public static BufferedImage imageDistinguish(){ return GetRobot.getRobot().createScreenCapture(new Rectangle(1920, 1080)); } } ``` //画图 ``` package image; import java.awt.Graphics; import java.awt.Image; import java.awt.image.ImageObserver; import javax.swing.JFrame; import javax.swing.JPanel; public class Paint{ JFrame jf = new JFrame(); public Paint() { } public void show() { jf.setSize(1000, 800); jf.setLocation(300, 100); jf.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); jf.setTitle("画布"); jf.add(new MyCavanse()); jf.setResizable(false); jf.setVisible(true); } public static class MyCavanse extends JPanel{ @Override public void update(Graphics g){ paint(g); } public void paint(Graphics g) { g.drawImage(ImageDistinguish.imageDistinguish(), 0, 0, 1000, 800, new ImageObserver() { @Override public boolean imageUpdate(Image img, int infoflags, int x, int y, int width, int height) { return false; } }); repaint(); } } } ``` //单利获取Robot,应该会快一点吧= = ``` package image; import java.awt.AWTException; import java.awt.Robot; public class GetRobot { private static Robot r = null; public static Robot getRobot() { try { if(r == null) r = new Robot(); } catch (AWTException e) { } return r; } } ``` 还有如果知道怎么把这个弄成一个视频,知道的花还请大佬告诉一下^_^

Java写键盘按键脚本,希望大佬不吝赐教

问题描述: 1. 想通过Java去实现键盘按键脚本 2. 自己也尝试过用Robot去完成 3. 实现了 4. 切换到游戏窗口中,却没有反应了 5. 部分关键代码 ``` //线程中的方法 run(){ keyPress(robot, KeyEvent.VK_A); } ``` 7. 这样写为什么游戏窗口接收不到A, 8. 可以接受其他语言实现。 **---------------------------感谢各位大佬能够回复小弟问题------------------------**

用 java 实现简单截屏

我需要有人给我讲一下截屏的原理是什么?原理要详细! 还有Java简单实现的过程

eclipse 中JAVA如何实现清屏

编辑了一段代码,让用户输入账号密码,如果账号密码正确就进入选择界面,在进入选择界面之前,我想把屏幕上面输入的账号密码吗全部清除!该如何实现!不用循环换行java里面的方法行吗?

谁能帮我把这个代码补全,就差一点点了。java语法编写本地监控系统

package com.tz.util; import java.awt.Dimension; import java.awt.Rectangle; import java.awt.Robot; import java.awt.Toolkit; import java.awt.image.BufferedImage; import javax.swing.ImageIcon; import javax.swing.JFrame; import javax.swing.JLabel; import javax.swing.JOptionPane; /** *java开发本地屏幕监控系统 *@author Friend *@version v1.0 */ public class LocationScreen { public static void main(String[] args) { System.out.println("潭州Arry老师讲的真好"); try{ int choice =JOptionPane.showConfirmDialog(null,"请求控制对方电脑 ?","黄振锋要请求",JOptionPane.YES_NO_CANCEL_OPTION); if(choice==JOptionPane.NO_OPTION) { return; } JOptionPane.showInputDialog("请输入要连接的服务器ip(包括端口号)","127.0.0.1:10000"); JFrame jframe=new JFrame("潭州学院本地监控系统"); jframe.setSize(600,600);//设置窗体大小 jframe.setVisible(true);//设置窗体课件 jframe.setAlwaysOnTop(true);//设置置顶 jframe.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);//自动关闭线程 //定义方法,能够直接查询本地操作系统 Toolkit tk=Toolkit.getDefaultToolkit(); //获取屏幕的大小 Dimension dm= tk.getScreenSize(); JLabel imageLabel=new JLabel(); jframe.add(imageLabel); Robot robot=new Robot(); Rectangle rec= new Rectangle(jframe.getWidth(),0,(int)dm.getWidth()-jframe.getWidth(),(int)dm.getHeight()); BufferedImage bufImg= robot.createScreenCapture(rec); //imageLabel.setIcon(new ImageIcon(buffImg)); }catch(Exception e) { e.printStackTrace(); } } }

Robot

Description Let (x1, y1), …, (xn, yn) be a collection of n points in a two-dimensional plane. Your goal is to navigate a robot from point (x1, y1) to point (xn, yn). From any point (xi, yi), the robot may travel to any other point (xj, yj) at most R units away at a speed of 1 unit per second. Before it does this, however, the robot must turn until it faces (xj, yj); this turning occurs at a rate of 1 degree per second. Compute the shortest time needed for the robot to travel from point (x1, y1) to (xn, yn). Assume that the robot initially faces (xn, yn). To prevent floating-point precision issues, you should use the double data type instead of float. It is guaranteed that the unrounded shortest time will be no more than 0.4 away from the closest integer. Also, if you decide to use inverse trigonometric functions in your solution (hint, hint!), try atan2() rather than acos() or asin(). Input The input test file will contain multiple test cases. Each test case will begin with a single line containing an integer R, the maximum distance between points that the robot is allowed to travel (where 10 ≤ R ≤ 1000), and an integer n, the number of points (where 2 ≤ n ≤ 20). The next n lines each contain 2 integer values; here, the ith line contains xi and yi (where −1000 ≤ xi, yi ≤ 1000). Each of the points is guaranteed to be unique. The end-of-file is denoted by a test case with R = n = −1. Output The output test file should contain a single line per test case indicating the shortest possible time in second (rounded to the nearest integer) required for the robot to travel from (x1, y1) to (xn, yn). If no trip is possible, print “impossible” instead. Sample Input 10 2 0 0 7 0 10 3 0 0 7 0 14 5 10 3 0 0 7 0 14 10 -1 -1 Sample Output 7 71 impossible

如果能重来,我不会选择北漂——初见北京

一个人走的路

技术大佬:我去,你写的 switch 语句也太老土了吧

昨天早上通过远程的方式 review 了两名新来同事的代码,大部分代码都写得很漂亮,严谨的同时注释也很到位,这令我非常满意。但当我看到他们当中有一个人写的 switch 语句时,还是忍不住破口大骂:“我擦,小王,你丫写的 switch 语句也太老土了吧!” 来看看小王写的代码吧,看完不要骂我装逼啊。 private static String createPlayer(PlayerTypes p...

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

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

我说我不会算法,阿里把我挂了。

不说了,字节跳动也反手把我挂了。

2020年大厂Java面试前复习的正确姿势(800+面试题答案解析)

前言 个人觉得面试也像是一场全新的征程,失败和胜利都是平常之事。所以,劝各位不要因为面试失败而灰心、 丧失斗志。也不要因为面试通过而沾沾自喜,等待你的将是更美好的未来,继续加油! 本篇分享的面试题内容包括:Java、MyBatis、ZooKeeper、Dubbo、Elasticsearch、Redis、MySQL、Spring、SpringBoot、SpringCloud、RabbitMQ...

抖音上很火的时钟效果

反正,我的抖音没人看,别人都有几十万个赞什么的。 发到CSDN上来,大家交流下~ 主要用到原生态的 JS+CSS3。 具体不解释了,看注释: &lt;!DOCTYPE html&gt; &lt;html lang="en"&gt; &lt;head&gt; &lt;meta charset="UTF-8"&gt; &lt;title&gt;Title&lt;/tit...

记录下入职中软一个月(外包华为)

我在年前从上一家公司离职,没想到过年期间疫情爆发,我也被困在家里,在家呆着的日子让人很焦躁,于是我疯狂的投简历,看面试题,希望可以进大公司去看看。 我也有幸面试了我觉得还挺大的公司的(虽然不是bat之类的大厂,但是作为一名二本计算机专业刚毕业的大学生bat那些大厂我连投简历的勇气都没有),最后选择了中软,我知道这是一家外包公司,待遇各方面甚至不如我的上一家公司,但是对我而言这可是外包华为,能...

又出事了?网站被攻击了?高中生?

北京时间2020年3月27日9点整,如往常一样来到公司,带开电脑,正准备打开Github网站看一会源代码,再开始手头的工作。哟吼,一直打不开,一直出现如下页面: 我想很多网友也尝到了甜头,各大技术群炸开了锅,据网友反馈有攻击者正在发起大规模的中间人挟持,京东和Github等网站等网站都受到了影响。 什么是中间中间人挟持呢? 简而言之,就是攻击者在数据网络传输的过程中,截获传输过程中的数据并篡改...

培训班出来的人后来都怎么样了?(二)

接着上回说,培训班学习生涯结束了。后面每天就是无休止的背面试题,不是没有头脑的背,培训公司还是有方法的,现在回想当时背的面试题好像都用上了,也被问到了。回头找找面试题,当时都是打印下来天天看,天天背。 不理解呢也要背,面试造飞机,上班拧螺丝。班里的同学开始四处投简历面试了,很快就有面试成功的,刚开始一个,然后越来越多。不知道是什么原因,尝到胜利果实的童鞋,不满足于自己通过的公司,嫌薪水要少了,选择...

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

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

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

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

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

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

工作八年,月薪60K,裸辞两个月,投简历投到怀疑人生!

近日,有网友在某职场社交平台吐槽,自己裸辞两个月了,但是找工作却让自己的心态都要崩溃了,全部无果,不是已查看无回音,就是已查看不符合。 “工作八年,两年一跳,裸辞两个月了,之前月薪60K,最近找工作找的心态崩了!所有招聘工具都用了,全部无果,不是已查看无回音,就是已查看不符合。进头条,滴滴之类的大厂很难吗???!!!投简历投的开始怀疑人生了!希望 可以收到大厂offer” 先来看看网...

我把华为小米年报放一起,发现华为才是真·手机公司,小米确实不靠卖手机赚钱...

郭一璞 发自 凹非寺量子位 报道 | 公众号 QbitAI国产手机界的两大玩家,华为&amp;小米,昨天在同一天前后脚发布了2019年财报。同行冤家,发财报也碰在了同一天。那我们就对比...

大牛都会用的IDEA调试技巧!!!

导读 前天面试了一个985高校的实习生,问了他平时用什么开发工具,他想也没想的说IDEA,于是我抛砖引玉的问了一下IDEA的调试用过吧,你说说怎么设置断点...

97年世界黑客编程大赛冠军作品(大小仅为16KB),惊艳世界的编程巨作

这是世界编程大赛第一名作品(97年Mekka ’97 4K Intro比赛)汇编语言所写。 整个文件只有4095个字节, 大小仅仅为16KB! 不仅实现了3D动画的效果!还有一段震撼人心的背景音乐!!! 内容无法以言语形容,实在太强大! 下面是代码,具体操作看最后! @echo off more +1 %~s0|debug e100 33 f6 bf 0 20 b5 10 f3 a5...

不要再到处使用 === 了

我们知道现在的开发人员都使用 === 来代替 ==,为什么呢?我在网上看到的大多数教程都认为,要预测 JavaScript 强制转换是如何工作这太复杂了,因此建议总是使用===。这些都...

什么是a站、b站、c站、d站、e站、f站、g站、h站、i站、j站、k站、l站、m站、n站?00后的世界我不懂!

A站 AcFun弹幕视频网,简称“A站”,成立于2007年6月,取意于Anime Comic Fun,是中国大陆第一家弹幕视频网站。A站以视频为载体,逐步发展出基于原生内容二次创作的完整生态,拥有高质量互动弹幕,是中国弹幕文化的发源地;拥有大量超粘性的用户群体,产生输出了金坷垃、鬼畜全明星、我的滑板鞋、小苹果等大量网络流行文化,也是中国二次元文化的发源地。 B站 全称“哔哩哔哩(bilibili...

十个摸鱼,哦,不对,是炫酷(可以玩一整天)的网站!!!

文章目录前言正文**1、Kaspersky Cyberthreat real-time map****2、Finding Home****3、Silk – Interactive Generative Art****4、Liquid Particles 3D****5、WINDOWS93****6、Staggering Beauty****7、Ostagram图片生成器网址****8、全历史网址*...

终于,月薪过5万了!

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

毕业5年,我熬夜整理出了这50个优质的电子书网站,吐血推荐!

大家好,我是武哥,最近经常有小伙伴问我要电子书,都什么年代了,还找不到电子书吗?如果要说原因,那就是你还没遇到武哥我(手动滑稽~)!我今天把这么多年我经常看的电子书网站整理一下给大家,基本上能解决大家的需求。不管是在校生还是已经工作了,相信肯定对你有所帮助! 1.鸠摩搜书 首先给大家推荐的网站是:鸠摩搜书 地址:https://www.jiumodiary.com/ 这个网上非常棒,上面有很多优质...

MySQL性能优化(五):为什么查询速度这么慢

前期回顾: MySQL性能优化(一):MySQL架构与核心问题 MySQL性能优化(二):选择优化的数据类型 MySQL性能优化(三):深入理解索引的这点事 MySQL性能优化(四):如何高效正确的使用索引 前面章节我们介绍了如何选择优化的数据类型、如何高效的使用索引,这些对于高性能的MySQL来说是必不可少的。但这些还完全不够,还需要合理的设计查询。如果查询写的很糟糕,即使表结构再合理、索引再...

大厂的 404 页面都长啥样?最后一个笑了...

每天浏览各大网站,难免会碰到404页面啊。你注意过404页面么?猿妹搜罗来了下面这些知名网站的404页面,以供大家欣赏,看看哪个网站更有创意: 正在上传…重新上传取消 腾讯 正在上传…重新上传取消 网易 淘宝 百度 新浪微博 正在上传…重新上传取消 新浪 京东 优酷 腾讯视频 搜...

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

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

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

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

总结了Mybatis,原来知识点也没多少嘛

看完这篇Mybatis,感觉你三天就会用了。

爬虫(101)爬点重口味的

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

疫情后北上广深租房价格跌了吗? | Alfred数据室

去年3月份我们发布了《北上广深租房图鉴》(点击阅读),细数了北上广深租房的各种因素对租房价格的影响。一年过去了,在面临新冠疫情的后续影响、城市尚未完全恢复正常运转、学校还没开学等情况下...

面试官给我挖坑:a[i][j] 和 a[j][i] 有什么区别?

点击上方“朱小厮的博客”,选择“设为星标”后台回复&#34;1024&#34;领取公众号专属资料本文以一个简单的程序开头——数组赋值:int LEN = 10000; int[][] ...

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

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

相关热词 c# 开发接口 c# 中方法上面的限制 c# java 时间戳 c#单元测试入门 c# 数组转化成文本 c#实体类主外键关系设置 c# 子函数 局部 c#窗口位置设置 c# list 查询 c# 事件 执行顺序
立即提问
相关内容推荐