434. Number of Segments in a String#1
来源:互联网 发布:匹克模考tpo软件 编辑:程序博客网 时间:2024/06/14 22:10
Solution#1
public class Solution { public int countSegments(String s) { if (s == null || s == 0) return 0; char[] c = s.toCharArray(); int i = 0; int count = 0; while (isSpace(c[i])) i++; //flag = 0代表前一个为空格 boolean flag = 1; for (; i < c.length(); i++) { if (!isSpace(c[i]) && flag == 0) { count++; flag = 1; continue; } if () } } public boolean isSpace(char c) { return c == ' '; }}
Problem#1
0 0
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String*
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String
- 434. Number of Segments in a String#1
- 434.Number of Segments in a String(String-Easy)
- String:434. Number of Segments in a String
- Intervals poj 3680 最小费用最大流
- 盒子模型(一)
- HDU1254-推箱子
- Xcode SVN配置方法
- 数据结构之排序算法(一)
- 434. Number of Segments in a String#1
- word2vec中一种模型的理解
- java编程思想读书笔记-第十五章 分布式计算
- PID
- Caffe学习系列(9):运行caffe自带的两个简单例子
- 跳台阶
- 授予身份及切换身份
- Longest Increasing Path in a Matrix (第五周 记忆化搜索)
- 2018网易游戏雷火盘古实习生笔试