FilesExpand file tree

master

/

68_fullJustify.go

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

103 lines (86 loc) · 1.44 KB

master

/

68_fullJustify.go

Copy path

Top

File metadata and controls

• Code
• Blame

103 lines (86 loc) · 1.44 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

package main

import (

"fmt"

)

func main() {

words := []string{"What", "must", "be", "acknowledgment", "shall", "be"}

maxWidth := 16

fmt.Println(fullJustify(words, maxWidth))

}

func fullJustify(words []string, maxWidth int) []string {

lw := len(words)

if lw < 1 {

return words

}

var ret []string

length := 0

num := 0

blank := 0

reminder := 0

quotient := 0

last := 0

for i := 0; i < lw; i++ {

last = i - 1

length += len(words[i])

if length+num < maxWidth {

num++

continue

}

if length+num == maxWidth {

num++

if i == lw-1 {

break

}

last = i

} else {

length -= len(words[i])

}

tmp := ""

blank = maxWidth - length

if num == 1 {

reminder = 0

quotient = blank

} else {

quotient = blank / (num - 1)

reminder = blank % (num - 1)

}

for j := 0; j < reminder; j++ {

tmp += words[last-num+j+1]

for k := 0; k <= quotient; k++ {

tmp += " "

}

}

m := num - 1

if num == 1 {

m = num

}

for j := reminder; j < m; j++ {

tmp += words[last-num+j+1]

for k := 0; k < quotient; k++ {

tmp += " "

}

}

if num > 1 {

tmp += words[last]

}

ret = append(ret, tmp)

if last == i-1 {

length = len(words[i])

num = 1

} else {

length = 0

num = 0

}

}

tmp := ""

for j := num; j > 1; j-- {

tmp += words[lw-j]

tmp += " "

}

tmp += words[lw-1]

for k := 0; k < maxWidth-length-num+1; k++ {

tmp += " "

}

ret = append(ret, tmp)

return ret

}