我有这个例子:
0 10000101 00111100000000000000000
并希望将其转换为十进制数.
到目前为止,我已经有了获得指数部分的代码:
String[]hex={"0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F"};
String[]binary={"0000","0001","0010","0011","0100","0101","0110","0111","1000","1001","1010","1011","1100","1101","1110","1111"};
String userInput="429E0000";
String result="";
for(int i=0;i<userInput.length();i++)
{
char temp=userInput.charAt(i);
String temp2=""+temp+"";
for(int j=0;j<hex.length;j++)
{
if(temp2.equalsIgnoreCase(hex[j]))
{
result=result+binary[j];
}
}
}
System.out.println(result);
int exponent = Integer.parseInt(result.substring(1,9),2)-127;
System.out.println(exponent);
Run Code Online (Sandbox Code Playgroud)
Java中是否有任何内置命令?
如果可能的话,我如何延长滑块长度和宽度.最重要的是,长度.
下面是Jsliders的一些代码.
slider = new JSlider(0,180);
slider.setMajorTickSpacing(30);
slider.setMinorTickSpacing(15);
slider.setPaintTicks(true);
slider.setPaintLabels(true);
slider.setValue(0);
JPanel panel = new JPanel();
panel.add(slider);
Run Code Online (Sandbox Code Playgroud)
我试过做slider.setSize(100,100); 类似的东西,但似乎并没有起作用.有什么建议?
ps(我也想知道滑块上编码的颜色是否可以填充青色等不同的颜色,如果超过某个值,可能会变为红色.现在它设置为默认值,它充满了光线蓝色.)
所以在Java上,"AND"语句是&&,"OR"语句是|| ...
那么XOR呢......那就是我有两个选择.我必须选一个,但我不能同时选择.
然而,
private class CheckBoxListener implements ItemListener{
public void itemStateChanged(ItemEvent e)
{
if(one.isSelected()^two.isSelected()){
thehandler handler = new thehandler();
button.addActionListener(handler);
}
}}
Run Code Online (Sandbox Code Playgroud)
即使我同时选中了两个复选框,该按钮也会"启用".这是按钮fyi的处理程序:
private class thehandler implements ActionListener{
public void actionPerformed(ActionEvent event){
dispose();
}
Run Code Online (Sandbox Code Playgroud)
因此,如果两者都被选中,并且如果我单击按钮.框架不应该丢弃.它应该只在选择其中任何一个时处理.
我有高分辨率数据(500赫兹).我在中午12:00:00开始
总共有720万个数据点<7,200,000x1 double>被称为数据.我如何实时绘制它,如下午12点,下午1点,下午2点,下午3点,下午4点等(日期刻度)
我正在尝试学习Haskell,并正在研究递归函数的书籍问题.
> If X_1 = 1 then X_2 = 1 + X_1 = 2, X_3 = 1 + X_1 + X_2
or when it is 5, X_5 = 1 + X_4 + X_3 + X_2 + X_1 = 16, and so forth.
Run Code Online (Sandbox Code Playgroud)
我尝试在haskell上这样做:
test :: Int -> Int
test 1 = 1
test n = sum[test n .. test (n-1)]
Run Code Online (Sandbox Code Playgroud)
但输出总是1.我认为我必须首先做一个函数保护然后总结它但我不知道如何用递归行为来做.