Wayfair
  • OA
    • Karat
      • 811. Subdomain Visit Count
      • Ads Conversion Rate
      • Recommend Movie
      • Longest Common Continuous Subarray
      • Course Overlap
      • Halfway courses
      • Find one rectangle
      • Find all rectangles
      • Find Multiple Shapes
      • word wrap
      • word processor
      • Basic Calculator
      • Basic Calculator with parenthesis
      • 带变量计算器
      • Valid Matrix
      • nonogram
      • Node with 0 or 1 parents
      • 两个节点是否有公共祖先
      • 最远祖先
      • invalid Badge Records
      • 一小时内access多次
      • canSchedule
      • spareTime
      • sparse vector
      • sparse vector 实现add,dot和cos
      • userlogs earliest and latest access time
      • resource Access with in 5 min
      • Find Word Path in Grid
      • Find legal moves
      • 找能去的所有0区域
      • 最短路径找treasure
  • VO
    • Coding
      • Valid Palindrome
      • Add String
      • Coupon
    • System design
    • BQ
    • OOD
  • SD
  • LeetCode Tag
  • VO Onsite
Powered by GitBook
On this page
  1. OA
  2. Karat

word wrap

给一个word list 和最大的长度,要求把这些word用 - 串联起来,但不能超过最大的长度。

public class Main {

    public String wordWrap(String[] words, int maxLen)
    {
        if(words == null || words.length == 0)
        {
            return null;
        }
        StringBuilder sb = new StringBuilder();
        int current = 0;
        int remain = maxLen;
        for(int i = 0; i< words.length; i++)
        {
            if(words[i].length > remain)
            {
                break;
            }
            sb.append(words[i]).append("-");
            remain -= words[i].length + 1;

        }
        sb.deleteCharAt(sb.length()-1);
        return sb.toString();
    }
    
}

PreviousFind Multiple ShapesNextword processor

Last updated 3 years ago