如何将此数组分解为类似字母类型的子数组（在连续位置）
例如，输入数组为：
String array = {"0","0","0","K","K","B","P","P","P","Z",
"Z","D","D","E","E","F","N","O","O}
输出：
first sub-array = {"O,O,O"}
second sub-array = {"K","K"}
third sub-array = {"O","O"}
展开
收起
1
条回答
写回答
写回答
-
#include您可以在下面的代码中使用堆栈进行结帐。
String data[] = { "0", "0", "0", "K", "K", "B", "P", "P", "P", "Z", "Z", "D", "D", "E", "E", "F", "N" }; // a = ['0','0','0','K','K','P','P','P','Z'] Stack<String> stack = new Stack<String>(); String prevValue = data[0]; for (int i = 1; i < data.length; i++) { if (data[i].equals(data[i - 1])) { prevValue = prevValue + data[i]; } else { stack.push(prevValue); prevValue = data[i]; } }stack.push(prevValue); System.out.println(stack);
2019-11-29 19:53:38赞同 展开评论 打赏
版权声明：本文内容由阿里云实名注册用户自发贡献，版权归原作者所有，阿里云开发者社区不拥有其著作权，亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容，填写侵权投诉表单进行举报，一经查实，本社区将立刻删除涉嫌侵权内容。
相关问答
